Skip to Main content Skip to Navigation
Reports

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 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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00072317
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 8:23:08 PM
Last modification on : Saturday, January 27, 2018 - 1:31:48 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:03:26 PM

Identifiers

  • HAL Id : inria-00072317, version 1

Collections

Citation

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

Share

Metrics

Record views

237

Files downloads

237