DocumentCode :
2836380
Title :
The half-edge tree: a compact data structure for level-of-detail tetrahedral meshes
Author :
Danovaro, Emanuele ; De Floriani, Leila ; Magillo, Paola ; Puppo, Enrico ; Sobrero, Davide ; Sokolovsky, Neta
Author_Institution :
Dept. of Comput. & Inf. Sci., Univ. of Genova, Italy
fYear :
2005
fDate :
13-17 June 2005
Firstpage :
332
Lastpage :
337
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.
Keywords :
computational geometry; edge detection; encoding; iterative methods; mesh generation; tree data structures; compact encoding; data structure; half-edge tree; iterative application; level-of-detail model; tetrahedral meshes; Application software; Availability; Computer science; Data mining; Data structures; Encoding; FETs; Information science; Tree data structures; Visualization;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Shape Modeling and Applications, 2005 International Conference
Print_ISBN :
0-7695-2379-X
Type :
conf
DOI :
10.1109/SMI.2005.47
Filename :
1563239
Link To Document :
بازگشت