The half-edge tree: a compact data structure for level-of-detail tetrahedral meshes
| Title | The half-edge tree: a compact data structure for level-of-detail tetrahedral meshes |
| Publication Type | Conference Papers |
| Year of Publication | 2005 |
| Authors | Danovaro E, De Floriani L, Magillo P, Puppo E, Sobrero D, Sokolovsky N |
| Conference Name | Shape Modeling and Applications, 2005 International Conference |
| Date Published | 2005/06// |
| Keywords | application;, compact, computational, data, detection;, edge, encoding;, generation;, geometry;, half-edge, iterative, level-of-detail, mesh, meshes;, methods;, model;, structure;, structures;, tetrahedral, tree, tree; |
| Abstract | 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. |
| DOI | 10.1109/SMI.2005.47 |