|
CGAL 6.3 - 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 Arrangement_on_curve_1<Traits> 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 | |
Classes | |
| class | CGAL::Arrangement_on_curve_1::Arrangement_on_curve_1< GeometryTraits_1, TopologyTraits, BinarySearch > |
| class | CGAL::Arrangement_on_curve_1::Unbounded_topology_traits< Point_1, VertexData, EdgeData, UseVector, Allocator > |
| The class template Unbounded_topology_traits provides a model of the AocTopologyTraits concept for 1D arrangements embedded on an unbounded carrier curve. More... | |