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

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.
Fichier principal
Vignette du fichier
adaptable_kernel_wae_2001.pdf (190.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00344964 , version 1 (08-12-2008)

Identifiers

Cite

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⟩

Collections

INRIA INRIA2
279 View
236 Download

Altmetric

Share

Gmail Facebook X LinkedIn More