CGoGN: n-dimensional Meshes with Combinatorial Maps. Many data structures are available for the representation and manipulation of meshes. In the context of algorithms that need to traverse local neighborhoods, topological structures are of particular interest. Many such existing structures are specialized for the representation of objects of a given dimension like surface or volume meshes. Many of them find their roots in combinatorial maps, a mathematical model for the representation of the topology of the subdivision of objects, which is consistently defined in any dimension.We present a practical implementation of combinatorial maps that competes with modern state-of-the-art data structures in terms of efficiency, memory footprint and usability. Among other benefits, developers can use a single consistent library to manipulate objects of various dimensions.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 1 article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Dufourd, Jean-Fran├žois: Formal study of functional orbits in finite domains (2015)