An Adaptable and Extensible Geometry Kernel

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 [9], the Computational Geometry Algorithms Library.

• Type: Conference
• Year: 2001
• Where: WAE
• Authors: Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel
• Keywords: Algorithms, Constant-size Geometric Objects, Geometric Algorithms, Geometric Objects, WAE 2001