Non-manifold Decomposition in Arbitrary Dimensions

In this paper we consider the problem of decomposing a nonmanifold n-dimensional object described by an abstract simplicial complex into an assembly of 'more-regular' components. Manifolds, which would be natural candidates for components, cannot be used to this aim in high dimensions because they are 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 arbitrary complex into an assembly of 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 complexity of such models.

[1]  Neil F. Stewart,et al.  An extension of manifold boundary representations to the r-sets , 1992, TOGS.

[2]  Kevin Weiler.  Topological Structures for Geometric Modeling , 1986 .

[3]  Martti Mäntylä,et al.  Introduction to Solid Modeling , 1988 .

[4]  Adam Ostaszewski,et al.  Topology : a geometric approach , 1992 .

[5]  Leila De Floriani,et al.  Non-manifold Multi-tessellation: From Meshes to Iconic Representations of Objects , 2001, IWVF.

[6]  Gabriel Taubin,et al.  Converting sets of polygons to manifold surfaces by cutting and stitching , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[7]  Bianca Falcidieno,et al.  Two‐manifold cell‐decomposition of r‐sets. , 1992, Comput. Graph. Forum.

[8]  Abigail Thompson,et al.  Thin Position and the Recognition Problem for $\bold{S^3}$ , 1994 .

[9]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[10]  Jarek Rossignac,et al.  Matchmaker: manifold BReps for non-manifold r-sets , 1999, SMA '99.

[11]  Pascal Lienhardt,et al.  Aspects in Topology-Based Geometric Modeling , 1997, DGCI.

[12]  Tony C. Woo,et al.  A Combinatorial Analysis of Boundary Data Structure Schemata , 1985, IEEE Computer Graphics and Applications.

[13]  Max K. Agoston.  Algebraic topology: A first course , 1976 .

[14]  David P. Dobkin,et al.  Primitives for the manipulation of three-dimensional subdivisions , 1987, SCG '87.

[15]  Pascal Lienhardt,et al.  Different Combinatorial Models based on the Map Concept for the Representation of Subsets of Cellular Complexes , 1993, Modeling in Computer Graphics.

[16]  Abigail Thompson,et al.  THIN POSITION AND THE RECOGNITION PROBLEM FOR S3 , 1994 .

[17]  李幼升,et al.  Ph , 1989 .

[18]  A. Markov,et al.  THE INSOLVABILITY OF THE PROBLEM OF HOMEOMORPHY. , 1964 .

[19]  Bruce G. Baumgart.  Winged edge polyhedron representation. , 1972 .

[20]  J. Stillwell.  Classical topology and combinatorial group theory , 1980 .

[21]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[22]  Jovan Popovic,et al.  Progressive simplicial complexes , 1997, SIGGRAPH.

[23]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[24]  Pascal Lienhardt,et al.  Topological models for boundary representation: a comparison with n-dimensional generalized maps , 1991, Comput. Aided Des..

[25]  A. Fomenko,et al.  THE PROBLEM OF DISCRIMINATING ALGORITHMICALLY THE STANDARD THREE-DIMENSIONAL SPHERE , 1974 .

[26]  W. B. R. Lickorish.  Simplicial moves on complexes and manifolds , 1999 .

[27]  Gabriel Taubin,et al.  Cutting and Stitching: Converting Sets of Polygons to Manifold Surfaces , 2001, IEEE Trans. Vis. Comput. Graph..