A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A Dimension-Independent Data Structure for Simplicial Complexes
[chapter]
2010
Proceedings of the 19th International Meshing Roundtable
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
doi:10.1007/978-3-642-15414-0_24
dblp:conf/imr/FlorianiHPC10
fatcat:w7acb7iwkfaeddk4pxzxuppzee