Data Structures for Simplicial Complexes: An Analysis And A Comparison

Simple item page
dc.contributor.authorFloriani, Leila Deen_US
dc.contributor.authorHui, Annieen_US
dc.contributor.editorMathieu Desbrun and Helmut Pottmannen_US
dc.date.accessioned2014-01-29T09:31:09Z
dc.date.available2014-01-29T09:31:09Z
dc.date.issued2005en_US
dc.description.abstractIn this paper, we review, analyze and compare representations for simplicial complexes. We classify such representations, based on the dimension of the complexes they can encode, into dimension-independent structures, and data structures for three- and for two-dimensional simplicial complexes. We further classify the data structures in each group according to the basic kinds of the topological entities they represent. We present a description of each data structure in terms of the entities and topological relations encoded, and we evaluate it based on its expressive power, on its storage cost and on the efficiency in supporting navigation inside the complex, i.e., in retrieving topological relations not explicitly encoded. We compare the various data structures inside each category based on the above features.en_US
dc.description.seriesinformationEurographics Symposium on Geometry Processing 2005en_US
dc.identifier.isbn3-905673-24-Xen_US
dc.identifier.issn1727-8384en_US
dc.identifier.urihttps://doi.org/10.2312/SGP/SGP05/119-128en_US
dc.publisherThe Eurographics Associationen_US
dc.titleData Structures for Simplicial Complexes: An Analysis And A Comparisonen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
119-128.pdf
Size:
242.16 KB
Format:
Adobe Portable Document Format
Download
Collections
SGP05: Eurographics Symposium on Geometry Processing