An Adaptable and Extensible Geometry Kernel - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2001

An Adaptable and Extensible Geometry Kernel

Michael Hoffmann
Lutz Kettner
  • Function : Author
Sylvain Pion
Michael Seel
  • Function : Author


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 implemente- d in C++, having special emphasis on adaptability, extensibility and efficienc- y. We achieve these goals following the generic programming paradigm and using templates as our tools. These ideas are realized and tested in Cgal [10], the Computational Geometry Algorithms Library.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4270.pdf (395.49 Ko) Télécharger le fichier

Dates and versions

inria-00072317 , version 1 (23-05-2006)


  • HAL Id : inria-00072317 , version 1


Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel. An Adaptable and Extensible Geometry Kernel. RR-4270, INRIA. 2001. ⟨inria-00072317⟩
103 View
141 Download


Gmail Facebook Twitter LinkedIn More