Skip to Main content Skip to Navigation

A Generic Implementation of dD Combinatorial Maps in CGAL

Guillaume Damiand 1 Monique Teillaud 2
1 M2DisCo - Geometry Processing and Constrained Optimization
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
2 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
Abstract : We present a generic implementation of dD combinatorial maps and linear cell complexes in CGAL, the Computational Geometry Algorithms Library. A combinatorial map describes an object subdivided into cells; a linear cell complex describes the linear geometry embedding of such a subdivision. In this paper, we show how generic programming and new techniques recently introduced in the C++11 standard allow a fully generic and customizable implementation of these two data structures, while maintaining optimal memory footprint and direct access to all information. We compare our implementation with existing 2D and 3D software, and illustrate its usage by two applications. To the best of our knowledge, the CGAL software packages presented here offer the only available generic implementation of combinatorial maps in any dimension.
Document type :
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Monique Teillaud Connect in order to contact the contributor
Submitted on : Monday, December 16, 2013 - 2:04:35 PM
Last modification on : Tuesday, June 1, 2021 - 2:08:07 PM
Long-term archiving on: : Tuesday, March 18, 2014 - 4:30:26 PM


Files produced by the author(s)


  • HAL Id : hal-00919177, version 1


Guillaume Damiand, Monique Teillaud. A Generic Implementation of dD Combinatorial Maps in CGAL. [Research Report] RR-8427, INRIA. 2013. ⟨hal-00919177⟩



Record views


Files downloads