carrier image

CGoGN: n-dimensional Meshes with Combinatorial Maps

Kraemer, Pierre, Lionel Untereiner, Thomas Jund, Sylvain Thery, and David Cazier

22nd International Meshing Roundtable, Springer-Verlag, pp.485-503, October 13-16 2013

IMR
PROCEEDINGS

22nd International Meshing Roundtable
Orlando, FL
October 13-16,2013

ICube, Universite de Strasbourg, CNRS
Email: kraemer@unistra.fr

Summary
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.

Download Full Paper (PDF Format)


Contact author(s) or publisher for availability and copyright information on above referenced article