A Generic Implementation of dD Combinatorial Maps in CGAL - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

A Generic Implementation of dD Combinatorial Maps in CGAL

(1) , (2)
Monique Teillaud


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 libraries implementing cellular structures, and illustrate its usage by two applications. To the best of our knowledge, the Cgal software package presented here offers the only available generic implementation of combinatorial maps in any dimension.
Fichier principal
Vignette du fichier
final.pdf (639.68 Ko) Télécharger le fichier
Vignette du fichier
intuitif-example-map.jpg (70.98 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Format : Figure, Image
Origin : Files produced by the author(s)

Dates and versions

hal-01090011 , version 1 (08-12-2014)



Guillaume Damiand, Monique Teillaud. A Generic Implementation of dD Combinatorial Maps in CGAL. International Meshing Roundtable, Oct 2014, Londres, United Kingdom. pp.46 - 58, ⟨10.1016/j.proeng.2014.10.372⟩. ⟨hal-01090011⟩
607 View
318 Download



Gmail Facebook Twitter LinkedIn More