Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Curves and surfaces for computer aided geometric design (3rd ed.): a practical guide
Curves and surfaces for computer aided geometric design (3rd ed.): a practical guide
Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
An implementation for maintaining arrangements of polygons
Proceedings of the eleventh annual symposium on Computational geometry
Static analysis yields efficient exact integer arithmetic for computational geometry
ACM Transactions on Graphics (TOG)
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Snap rounding line segments efficiently in two and three dimensions
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
The algorithm design manual
Handbook of discrete and computational geometry
Computational geometry software
Handbook of discrete and computational geometry
Generic programming and the STL: using and extending the C++ Standard Template Library
Generic programming and the STL: using and extending the C++ Standard Template Library
MAPC: a library for efficient and exact manipulation of algebraic points and curves
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
The Design and Implementation of Planar Maps in CGAL
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
The CGAL Kernel: A Basis for Geometric Computation
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
| Hi-index | 0.00 |
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 main taining 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.