An Adaptable and Extensible Geometry Kernel. Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, and Michael Seel. Research Report MPI-I-2001-1-004, Max-Planck-Institut für Informatik, September 2001.
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.
[PostScript]
[--> Conference
Version]
[CGAL Home Page]