An Algorithm for Decomposing Multi-dimensional Non-manifold Objects into Nearly Manifold Components

In this paper we address the problem of building valid representations for non-manifold d-dimensional objects. To this aim, we have developed a combinatorial approach based on decomposing a non-manifold d-dimensional object into an assembly of more regular components, that we call initial quasi-manifolds. We present a decomposition algorithm, whose complexity is slightly super-linear in the total number of simplexes. Our approach provides a rigorous basis for designing efficient dimension-independent data structures for describing non-manifold objects.