An Adaptable and Extensible Geometry Kernel

Abstract : Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects and operations on these representations. This paper describes how such a geometry kernel can be designed and implemented in C++, having special emphasis on adaptability, extensibility and efficiency. We achieve these goals following the generic programming paradigm and using templates as our tools. These ideas are realized and tested in CGAL, the Computational Geometry Algorithms Library.
Type de document :
Communication dans un congrès
Workshop on Algorithm Engineering, Aug 2001, Aarhus, Denmark. Springer, 2141, pp.79-90, 2001, Lecture Notes in Computer Science. 〈10.1007/3-540-44688-5〉
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00344964
Contributeur : Sylvain Pion <>
Soumis le : lundi 8 décembre 2008 - 01:33:44
Dernière modification le : jeudi 20 septembre 2018 - 07:54:02
Document(s) archivé(s) le : lundi 7 juin 2010 - 20:56:25

Fichier

adaptable_kernel_wae_2001.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel. An Adaptable and Extensible Geometry Kernel. Workshop on Algorithm Engineering, Aug 2001, Aarhus, Denmark. Springer, 2141, pp.79-90, 2001, Lecture Notes in Computer Science. 〈10.1007/3-540-44688-5〉. 〈inria-00344964〉

Partager

Métriques

Consultations de la notice

269

Téléchargements de fichiers

146