×

Code flexibility and program efficiency by genericity: Improving Cgal’s arrangements. (English) Zbl 1111.68723

Albers, Susanne (ed.) et al., Algorithms – ESA 2004. 12th annual European symposium, Bergen, Norway, September 14–17, 2004. Proceedings. Berlin: Springer (ISBN 3-540-23025-4/pbk). Lecture Notes in Computer Science 3221, 664-676 (2004).
Summary: Arrangements of planar curves are fundamental structures in computational geometry. We describe the recent developments in the arrangement package of Cgal the Computational Geometry Algorithms Library, making it easier to use, to extend and to adapt to a variety of applications. This improved flexibility of the code does not come at the expense of efficiency as we mainly use generic-programming techniques, which make dexterous use of the compilation process. To the contrary, we expedited key operations as we demonstrate by experiments.
For the entire collection see [Zbl 1060.68003].

MSC:

68U05 Computer graphics; computational geometry (digital and algorithmic aspects)

Software:

CGAL; MAPC
PDFBibTeX XMLCite
Full Text: DOI