An Adaptable and Extensible Geometry Kernel - Archive ouverte HAL Access content directly
Journal Articles Computational Geometry Year : 2007

An Adaptable and Extensible Geometry Kernel

(1) , (2) , (1) , (3) , (1)
1
2
3

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, see http://www.cgal.org/.
Fichier principal
Vignette du fichier
kernel.pdf (251.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00344363 , version 1 (04-12-2008)

Identifiers

Cite

Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel. An Adaptable and Extensible Geometry Kernel. Computational Geometry, 2007, Special Issue on CGAL, 38 (1-2), pp.16-36. ⟨10.1016/j.comgeo.2006.11.004⟩. ⟨inria-00344363⟩

Collections

INRIA INRIA2
258 View
351 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More