loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Shape Modeling and Applications 2005 (SMI' 05)
The Half-Edge Tree: A Compact Data Structure for Level-of-Detail Tetrahedral Meshes
Cambridge, Massachusetts
June 13-June 17
ISBN: 0-7695-2379-X
ASCII Text
x 
 
Emanuele Danovaro, Leila De Floriani, Paola Magillo, Enrico Puppo, Davide Sobrero, Neta Sokolovsky, "The Half-Edge Tree: A Compact Data Structure for Level-of-Detail Tetrahedral Meshes," Shape Modeling and Applications, International Conference on, pp. 334-339, International Conference on Shape Modeling and Applications 2005 (SMI' 05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/SMI.2005.47,
author = {Emanuele Danovaro and Leila De Floriani and Paola Magillo and Enrico Puppo and Davide Sobrero and Neta Sokolovsky},
title = {The Half-Edge Tree: A Compact Data Structure for Level-of-Detail Tetrahedral Meshes},
journal ={Shape Modeling and Applications, International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2379-X},
pages = {334-339},
doi = {http://doi.ieeecomputersociety.org/10.1109/SMI.2005.47},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Shape Modeling and Applications, International Conference on
TI - The Half-Edge Tree: A Compact Data Structure for Level-of-Detail Tetrahedral Meshes
SN - 0-7695-2379-X
SP334
EP339
A1 - Emanuele Danovaro,
A1 - Leila De Floriani,
A1 - Paola Magillo,
A1 - Enrico Puppo,
A1 - Davide Sobrero,
A1 - Neta Sokolovsky,
PY - 2005
KW - null
VL - 0
JA - Shape Modeling and Applications, International Conference on
ER -
 
Emanuele Danovaro, University of Genova
Leila De Floriani, University of Genova
Paola Magillo, University of Genova
Enrico Puppo, University of Genova
Davide Sobrero, University of Genova
Neta Sokolovsky, Ben Gurion University of the Negev
We propose a new data structure for the compact encoding of a Level-Of-Detail (LOD) model of a threedimensional 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.
Citation:
Emanuele Danovaro, Leila De Floriani, Paola Magillo, Enrico Puppo, Davide Sobrero, Neta Sokolovsky, "The Half-Edge Tree: A Compact Data Structure for Level-of-Detail Tetrahedral Meshes," smi, pp.334-339, International Conference on Shape Modeling and Applications 2005 (SMI' 05), 2005
Usage of this product signifies your acceptance of the Terms of Use.