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

Emanuele Danovaro, Leila De Floriani, Paola Magillo, Enrico Puppo, Davide Sobrero, Neta Sokolovsky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings - International Conference on Shape Modeling and Applications, SMI'05
PublisherInstitute of Electrical and Electronics Engineers
Pages332-337
Number of pages6
ISBN (Print)076952379X, 9780769523798
DOIs
StatePublished - 1 Jan 2005
EventInternational Conference on Shape Modeling and Applications, SMI'05 - Cambridge, MA, United States
Duration: 13 Jun 200517 Jun 2005

Publication series

NameProceedings - International Conference on Shape Modeling and Applications, SMI'05
Volume2005

Conference

ConferenceInternational Conference on Shape Modeling and Applications, SMI'05
Country/TerritoryUnited States
CityCambridge, MA
Period13/06/0517/06/05

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'The half-edge tree: A compact data structure for level-of-detail tetrahedral meshes'. Together they form a unique fingerprint.

Cite this