Designing a Computational Geometry Algorithms Library

Schirra, Stefan

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Report

Designing a Computational Geometry Algorithms Library

MPS-Authors

/persons/resource/persons45391

Schirra, Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

MPI-I-97-1-014.pdf
(Any fulltext), 136KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Schirra, S.(1997). Designing a Computational Geometry Algorithms Library (MPI-I-1997-1-014). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-9D89-8

Abstract

In these notes, which were originally written as lecture notes for Advanced School on Algorithmic Foundations of Geographic Information Systems, CISM, held in Udine, Italy, in September, 1996, we discuss issues related to the design of a computational geometry algorithms library. We discuss modularity and generality, efficiency and robustness, and ease of use. We argue that exact geometric computation is the most promising approach to ensure robustness in a geometric algorithms library. Many of the presented concepts have been developed jointly in the kernel design group of CGAL and/or in the geometry group of LEDA. However, the view held in these notes is a personal view, not the official view of CGAL.