Skip to Main content Skip to Navigation
Journal articles

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, see http://www.cgal.org/.
Complete list of metadatas

Cited literature [41 references]  Display  Hide  Download

https://hal.inria.fr/inria-00344363
Contributor : Sylvain Pion <>
Submitted on : Thursday, December 4, 2008 - 3:38:36 PM
Last modification on : Tuesday, March 5, 2019 - 9:30:11 AM
Long-term archiving on: : Thursday, October 11, 2012 - 12:32:38 PM

File

kernel.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel. An Adaptable and Extensible Geometry Kernel. Computational Geometry, Elsevier, 2007, Special Issue on CGAL, 38 (1-2), pp.16-36. ⟨10.1016/j.comgeo.2006.11.004⟩. ⟨inria-00344363⟩

Share

Metrics

Record views

443

Files downloads

528