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.

P. Kraemer , L. Untereiner , T. Jund , S. Thery , D. Cazier

22nd International Meshing Roundtable , page 485-503 - 2013

@Inproceedings{4-KUJT13,
 author = {Kraemer, P. and Untereiner, L. and Jund, T. and Thery, S. and Cazier, D.},
 title = {CGoGN: N-dimensional Meshes with Combinatorial Maps},
 booktitle  = {22nd International Meshing Roundtable},
 pages = {485-503},
 month = {Oct},
 year = {2013},
 publisher = {Springer International Publishing},
 doi = {10.1007/978-3-319-02335-9_27},
 x-international-audience = {Yes},
 x-language = {EN},
 url = {http://publis.icube.unistra.fr/4-KUJT13}
}