Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Sylvain Pion Connect in order to contact the contributor
Submitted on : Monday, December 8, 2008 - 1:33:44 AM
Last modification on : Friday, February 4, 2022 - 3:29:55 AM
Long-term archiving on: : Monday, June 7, 2010 - 8:56:25 PM


Files produced by the author(s)




Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel. An Adaptable and Extensible Geometry Kernel. Workshop on Algorithm Engineering, Aug 2001, Aarhus, Denmark. pp.79-90, ⟨10.1007/3-540-44688-5⟩. ⟨inria-00344964⟩



Record views


Files downloads