Two-dimensional arrangements in CGAL and adaptive point location for parametric curves

Iddo Hanniel, Dan Halperin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Given a collection C of curves in the plane, the arrangement of C is the subdivision of the plane into vertices, edges and faces induced by the curves in C. Constructing arrangements of curves in the plane is a basic problem in computational geometry. Applications relying on arrangements arise in fields such as robotics, computer vision and computer graphics. Many algorithms for constructing and maintaining arrangements under various conditions have been published in papers. However, there are not many implementations of (general) arrangements packages available. We present an implementation of a generic and robust package for arrangements of curves that is part of the CGAL1 library. We also present an application basedon this package for adaptive point location in arrangements of parametric curves.

Original languageEnglish
Title of host publicationAlgorithm Engineering - 4th International Workshop, WAE 2000, Proceedings
EditorsStefan Naher, Dorothea Wagner
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540425128, 9783540425120
StatePublished - 2001
Event4th International Workshop on Algorithm Engineering, WAE 2000 - Saarbrucken, Germany
Duration: 5 Sep 20008 Sep 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1982 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference4th International Workshop on Algorithm Engineering, WAE 2000


Dive into the research topics of 'Two-dimensional arrangements in CGAL and adaptive point location for parametric curves'. Together they form a unique fingerprint.

Cite this