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

https://hal.inria.fr/inria-00344964
Contributor : Sylvain Pion <>
Submitted on : Monday, December 8, 2008 - 1:33:44 AM
Last modification on : Thursday, May 27, 2021 - 1:54:05 PM
Long-term archiving on: : Monday, June 7, 2010 - 8:56:25 PM

File

adaptable_kernel_wae_2001.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. Workshop on Algorithm Engineering, Aug 2001, Aarhus, Denmark. pp.79-90, ⟨10.1007/3-540-44688-5⟩. ⟨inria-00344964⟩

Share

Metrics

Record views

478

Files downloads

354