A Decomposition-based Representation for 3D Simplicial Complexes

Simple item page
dc.contributor.authorHui, Annieen_US
dc.contributor.authorVaczlavik, Lucasen_US
dc.contributor.authorFloriani, Leila Deen_US
dc.contributor.editorAlla Sheffer and Konrad Polthieren_US
dc.date.accessioned2014-01-29T08:14:03Z
dc.date.available2014-01-29T08:14:03Z
dc.date.issued2006en_US
dc.description.abstractWe define a new representation for non-manifold 3D shapes described by three-dimensional simplicial complexes, that we call the Double-Level Decomposition (DLD) data structure. The DLD data structure is based on a unique decomposition of the simplicial complex into nearly manifold parts, and encodes the decomposition in an efficient and powerful two-level representation. It is compact, and it supports efficient topological navigation through adjacencies. It also provides a suitable basis for geometric reasoning on non-manifold shapes. We describe an algorithm to decompose a 3D simplicial complex into nearly manifold parts. We discuss how to build the DLD data structure from a description of a 3D complex as a collection of tetrahedra, dangling triangles and wire edges, and we present algorithms for topological navigation. We present a thorough comparison with existing representations for 3D simplicial complexes.en_US
dc.description.seriesinformationSymposium on Geometry Processingen_US
dc.identifier.isbn3-905673-24-Xen_US
dc.identifier.issn1727-8384en_US
dc.identifier.urihttps://doi.org/10.2312/SGP/SGP06/101-110en_US
dc.publisherThe Eurographics Associationen_US
dc.titleA Decomposition-based Representation for 3D Simplicial Complexesen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
101-110.pdf
Size:
213.32 KB
Format:
Adobe Portable Document Format
Download
Collections
SGP06: Eurographics Symposium on Geometry Processing