A scalable data structure for three-dimensional non-manifold objects

Simple item page
dc.contributor.authorFloriani, Leila Deen_US
dc.contributor.authorHui, Annieen_US
dc.contributor.editorLeif Kobbelt and Peter Schroeder and Hugues Hoppeen_US
dc.date.accessioned2014-01-29T08:19:40Z
dc.date.available2014-01-29T08:19:40Z
dc.date.issued2003en_US
dc.description.abstractIn this paper, we address the problem of representing and manipulating non-manifold, mixed-dimensional objects described by three-dimensional simplicial complexes embedded in the 3D Euclidean space. We describe the design and the implementation of a new data structure, that we call the non-manifold indexed data structure with adjacencies (NMIA), which can represent any three-dimensional Euclidean simplicial complex compactly, since it encodes only the vertices and the top simplexes of the complex plus a restricted subset of topological relations among simplexes. The NMIA structure supports efficient traversal algorithms which retrieve topological relations in optimal time, and it scales very well to the manifold case. Here, we sketch traversal algorithms, and we compare the NMIA structure with data structures for manifold and regular 3D simplicial complexes.en_US
dc.description.seriesinformationEurographics Symposium on Geometry Processingen_US
dc.identifier.isbn3-905673-06-1en_US
dc.identifier.issn1727-8384en_US
dc.identifier.urihttps://doi.org/10.2312/SGP/SGP03/072-082en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling -Curve, surface, solid and object representationsen_US
dc.titleA scalable data structure for three-dimensional non-manifold objectsen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
072-082.pdf
Size:
256.12 KB
Format:
Adobe Portable Document Format
Download
Collections
SGP03: Eurographics Symposium on Geometry Processing