|
CGAL 6.3-dev - 1D Arrangements
|
Given a set \(\mathcal{P}\) of points on a curve, the arrangement \({\mathcal A}({\mathcal P})\) is the subdivision of the curve induced by the points in \(\mathcal{P}\) into maximally connected cells. The cells can be \(0\)-dimensional (vertices) or \(1\)-dimensional (edges).
The class CGAL::Arrangement_on_curve_1::Arrangement_on_curve_1<GeometryTraits_1, TopologyTraits, BinarySearch> encapsulates a data structure that maintains arrangements of points. It comes with a variety of algorithms that operate on 1D arrangements, such as point-location queries and overlay computations, which are implemented as peripheral classes or as free (global) functions.
Topics | |
| Concepts | |
| I/O | |
| Free Functions | |
| Geometry Traits Classes | |
| Topology Traits Classes | |
| Tags | |
| Enumerations | |
Classes | |
| class | CGAL::Arrangement_on_curve_1::Arrangement_on_curve_1< GeometryTraits_1, TopologyTraits, BinarySearch > |
| Arrangement_on_curve_1 represents a subdivision of a continuous 1D curve, referred to as the master curve, into maximally connected subcurves. More... | |
| class | CGAL::Arrangement_on_curve_1::Copy_overlay_visitor< ArrangementA, ArrangementB, ArrangementR > |
| The class template Copy_overlay_visitor is an overlay visitor that copies the user data of the input cells to the cells of the resulting arrangement. More... | |
| class | CGAL::Arrangement_on_curve_1::Default_overlay_visitor< ArrangementA, ArrangementB, ArrangementR > |
| The class template Default_overlay_visitor is an overlay visitor whose callback functions do nothing; the cells of the resulting arrangement are left with default-constructed data, if any. More... | |