The Half-Edge Tree: A Compact Data Structure for Level-of-Detail Tetrahedral Meshes

We propose a new data structure for the compact encoding of a Level-Of-Detail (LOD) model of a threedimensional scalar field based on unstructured tetrahedral meshes. Such data structure, called a Half-Edge Tree (HET), is built through the iterative application of a half-edge collapse, i.e. by contracting an edge to one of its endpoints. We also show that selective refined meshes extracted from an HET contain on average about 34% and up to 75% less tetrahedra than those extracted from an LOD model built through a general edge collapse.

• Type: Conference
• Year: 2005
• Where: SMI
• Authors: Emanuele Danovaro, Leila De Floriani, Paola Magillo, Enrico Puppo, Davide Sobrero, Neta Sokolovsky
• Keywords: Data Structure, SMI 2005, Such Data Structure, Unstructured Tetrahedral Meshes