A dimension-independent data structure for simplicial complexes

Leila De Floriani, Annie Hui, Daniele Panozzo, David Canino

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider here the problem of representing non-manifold shapes discretized as d-dimensional simplicial Euclidean complexes. To this aim, we propose a dimension-independent data structure for simplicial complexes, called the Incidence Simplicial (IS) data structure, which is scalable to manifold complexes, and supports efficient navigation and topological modifications. The IS data structure has the same expressive power and exibits performances in query and update operations as the incidence graph, a widely-used representation for general cell complexes, but it is much more compact. Here, we describe the IS data structure and we evaluate its storage cost. Moreover, we present efficient algorithms for navigating and for generating a simplicial complex described as an IS data structure. We compare the IS data structure with the incidence graph and with dimension-specific representations for simplicial complexes.

Original languageEnglish (US)
Title of host publicationProceedings of the 19th International Meshing Roundtable, IMR 2010
Pages403-420
Number of pages18
DOIs
StatePublished - 2010
Event19th International Meshing Roundtable, IMR 2010 - Chattanooga, TN, United States
Duration: Oct 3 2010Oct 6 2010

Publication series

NameProceedings of the 19th International Meshing Roundtable, IMR 2010

Other

Other19th International Meshing Roundtable, IMR 2010
Country/TerritoryUnited States
CityChattanooga, TN
Period10/3/1010/6/10

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Modeling and Simulation

Fingerprint

Dive into the research topics of 'A dimension-independent data structure for simplicial complexes'. Together they form a unique fingerprint.

Cite this