A data structure for non-manifold simplicial d-complexes

Simple item page
dc.contributor.authorFloriani, Leila Deen_US
dc.contributor.authorGreenfieldboyce, Daviden_US
dc.contributor.authorHui, Annieen_US
dc.contributor.editorRoberto Scopigno and Denis Zorinen_US
dc.date.accessioned2014-01-29T09:19:49Z
dc.date.available2014-01-29T09:19:49Z
dc.date.issued2004en_US
dc.description.abstractWe propose a data structure for d-dimensional simplicial complexes, that we call the Simplified Incidence Graph (SIG). The simplified incidence graph encodes all simplices of a simplicial complex together with a set of boundary and partial co-boundary topological relations. It is a dimension-independent data structure in the sense that it can represent objects of arbitrary dimensions. It scales well to the manifold case, i.e. it exhibits a small overhead when applied to simplicial complexes with a manifold domain. Here, we present efficient navigation algorithms for retrieving all topological relations from a SIG, and an algorithm for generating a SIG from a representation of the complex as an incidence graph. Finally, we compare the simplified incidence graph with the incidence graph, with a widely-used data structure for d-dimensional pseudo-manifold simplicial complexes, and with two data structures specific for two- and three-dimensional simplicial complexes.en_US
dc.description.seriesinformationSymposium on Geometry Processingen_US
dc.identifier.isbn3-905673-13-4en_US
dc.identifier.issn1727-8384en_US
dc.identifier.urihttps://doi.org/10.2312/SGP/SGP04/085-094en_US
dc.publisherThe Eurographics Associationen_US
dc.titleA data structure for non-manifold simplicial d-complexesen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
085-094.pdf
Size:
169.53 KB
Format:
Adobe Portable Document Format
Download
Collections
SGP04: Eurographics Symposium on Geometry Processing