Abstract
In this paper we consider the problem of decomposing a nonmanifold n-dimensional object described byan abstract simplicial complex into an assemblyof ‘more-regular’ components. Manifolds, which would be natural candidates for components, cannot be used to this aim in high dimensions because theyare not decidable sets. Therefore, we define d-quasi-manifolds, a decidable superset of the class of combinatorial d-manifolds that coincides with d-manifolds in dimension less or equal than two. We first introduce the notion of d-quasi-manifold complexes, then we sketch an algorithm to decompose an arbitrarycomplex into an assemblyof quasi-manifold components abutting at non-manifold joints. This result provides a rigorous starting point for our future work, which includes designing efficient data structures for non-manifold modeling, as well as defining a notion of measure of shape complexityof such models.
Cite
CITATION STYLE
De Floriani, L., Mesmoudi, M. M., Morando, F., & Puppo, E. (2002). Non-manifold decomposition in arbitrary dimensions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2301, pp. 69–80). Springer Verlag. https://doi.org/10.1007/3-540-45986-3_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.