The half-edge tree: a compact data structure for level-of-detail tetrahedral meshes

TitleThe half-edge tree: a compact data structure for level-of-detail tetrahedral meshes
Publication TypeConference Papers
Year of Publication2005
AuthorsDanovaro E, De Floriani L, Magillo P, Puppo E, Sobrero D, Sokolovsky N
Conference NameShape Modeling and Applications, 2005 International Conference
Date Published2005/06//
Keywordsapplication;, 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.

DOI10.1109/SMI.2005.47