N-DIMENSIONAL GENERALIZED COMBINATORIAL MAPS AND CELLULAR QUASI-MANIFOLDS

DOI10.1142/S0218195994000173zbMath0821.57016MaRDI QIDQ4313800

Pascal Lienhardt

Publication date: 5 October 1995

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195994000173

zbMATH Keywords

duality; Euler characteristic; boundaries; orientability; cells; pseudo-manifolds; combinatorial cellular quasi- manifolds; subdivisions of quasi-manifolds

Mathematics Subject Classification ID

57Q05: General topology of complexes

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

57Q99: PL-topology

Related Items

Modeling and Manipulating Cell Complexes in Two, Three and Higher Dimensions, Combinatorial Maps for 2D and 3D Image Segmentation, COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS, Preserving consistency in geometric modeling with graph transformations, Maintaining Consistency of Spatial Information in the Hippocampal Network: A Combinatorial Geometry Model, Insertion and Expansion Operations for n-Dimensional Generalized Maps, HANDLEBODY REPRESENTATION FOR SURFACES AND ITS APPLICATIONS TO TERRAIN MODELING, Derived neighborhoods and frontier orders, The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes, Using bigraphs to model topological graphs embedded in orientable surfaces, Polynomial algorithms for open plane graph and subgraph isomorphisms, Formal specification and proofs for the topology and classification of combinatorial surfaces, Formal study of functional orbits in finite domains, Efficient search of combinatorial maps using signatures, Simploidals sets: Definitions, operations and comparison with simplicial sets, Topological 3D-manifolds: A statistical study of the cells, Triangulations in CGAL, On the complexity of submap isomorphism and maximum common submap problems, Consistently oriented dart-based 3D modelling by means of geometric algebra and combinatorial maps, Iterated foldings of discrete spaces and their limits: candidates for the role of Brownian map in higher dimensions, Efficient representation of Laguerre mosaics with an application to microstructure simulation of complex ore, Distributed combinatorial maps for parallel mesh processing, Equivalence between closed connected \(n\)-\(G\)-maps without multi-incidence and \(n\)-surfaces, Homology of cellular structures allowing multi-incidence, \(n\)D generalized map pyramids: definition, representations and basic operations, Vector graphics animation with time-varying topology, Parallel Homology Computation of Meshes, Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model, Frequent Submap Discovery, A Polynomial Algorithm for Submap Isomorphism, A First Step toward Combinatorial Pyramids in n-D Spaces, Border Operator for Generalized Maps