%0 Conference Paper
%B Shape Modeling and Applications, 2005 International Conference
%D 2005
%T The half-edge tree: a compact data structure for level-of-detail tetrahedral meshes
%A Danovaro,E.
%A De Floriani, Leila
%A Magillo,P.
%A Puppo,E.
%A Sobrero,D.
%A Sokolovsky,N.
%K application;
%K compact
%K computational
%K data
%K detection;
%K edge
%K encoding;
%K generation;
%K geometry;
%K half-edge
%K iterative
%K level-of-detail
%K mesh
%K meshes;
%K methods;
%K model;
%K structure;
%K structures;
%K tetrahedral
%K tree
%K tree;
%X 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.
%B Shape Modeling and Applications, 2005 International Conference
%P 332 - 337
%8 2005/06//
%G eng
%R 10.1109/SMI.2005.47