inria-00344964, version 1
An Adaptable and Extensible Geometry Kernel
Susan Hert a, 1Michael Hoffmann b, 2Lutz Kettner a, 1Sylvain Pion
3Michael Seel a, 1
Workshop on Algorithm Engineering 2141 (2001) 79-90
Résumé : 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.
- a – Max-Planck-Institut
- b – ETH Zurich
- 1 : Max Planck Institut für Informatik (MPII)
- Max-Planck-Institut
- 2 : Eldgenössische Technische Hochschule Zürich (ETH Zürich)
- ETH Zurich
- 3 : PRISME (INRIA Sophia Antipolis)
- INRIA
- Domaine : Informatique/Géométrie algorithmique
Informatique/Génie logiciel - Mots-clés : Computational geometry – library design – generic programming
- inria-00344964, version 1
- http://hal.inria.fr/inria-00344964
- oai:hal.inria.fr:inria-00344964
- Contributeur : Sylvain Pion
- Soumis le : Lundi 8 Décembre 2008, 01:33:44
- Dernière modification le : Mercredi 11 Février 2009, 14:57:25
Documents associés
Exporter