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 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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [24 references]  Display  Hide  Download


https://hal.inria.fr/hal-01090011
Contributor : Monique Teillaud <>
Submitted on : Monday, December 8, 2014 - 3:08:45 PM
Last modification on : Wednesday, October 31, 2018 - 12:24:22 PM
Document(s) archivé(s) le : Monday, March 9, 2015 - 11:56:37 AM

Files

final.pdf
Publisher files allowed on an open archive

Identifiers

Citation

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⟩

Share

Metrics

Record views

761

Files downloads

344