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. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
De Floriani, L., Hui, A., Panozzo, D., & Canino, D. (2010). A dimension-independent data structure for simplicial complexes. In Proceedings of the 19th International Meshing Roundtable, IMR 2010 (pp. 403–420). https://doi.org/10.1007/978-3-642-15414-0_24
Mendeley helps you to discover research relevant for your work.