The half-edge tree: a compact data structure for level-of-detail tetrahedral meshes
Emanuele Danovaro, Leila De Floriani, Paola Magillo, Enrico Puppo, Davide Sobrero, Neta Sokolovsky · 2006
We propose a new data structure for the compact encoding of a level-of detail (LOD) model of a three-dimensional 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.