de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

An Adaptable and Extensible Geometry Kernel

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44616

Hert,  Susan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44766

Kettner,  Lutz
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45191

Pion,  Sylvain
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45446

Seel,  Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Hert, S., Hoffmann, M., Kettner, L., Pion, S., & Seel, M. (2001). An Adaptable and Extensible Geometry Kernel. In G. S. Brodal, D. Frigioni, & A. Marchetti-Spaccamela (Eds.), Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01) (pp. 79-90). Berlin, Germany: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-3160-3
Abstract
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 Library.