Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


An adaptable and extensible geometry kernel

Hert, Susan and Hoffmann, Michael and Kettner, Lutz and Pion, Sylvain and Seel, Michael

MPI-I-2001-1-004. September 2001, 27 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
Geometric algorithms are based on geometric objects such as points,
lines and circles. The term \textit{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~\cite{svy-cgal}, the Computational Geometry Algorithms

References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-2001-1-004.pdfMPI_TR.ps351 KBytes; 367 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:

Hide details for BibTeXBibTeX
  AUTHOR = {Hert, Susan and Hoffmann, Michael and Kettner, Lutz and Pion, Sylvain and Seel, Michael},
  TITLE = {An adaptable and extensible geometry kernel},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-2001-1-004},
  MONTH = {September},
  YEAR = {2001},
  ISSN = {0946-011X},