Given a set of planar curves, the arrangement is the subdivision of the plane induced by the curves in into maximally connected cells. The cells can be -dimensional (vertices), -dimensional (edges) or -dimensional (faces).
The class Arrangement_2<Traits,Dcel> encapsulates a data structure that maintains arrangements of arbitrary bounded planar curves. It comes with a variety of algorithms that operate on planar arrangement, such as point-location queries and overlay computations, which are implemented as peripheral classes or as free (global) functions.
ArrangementDcel
ArrangementDcelVertex
ArrangementDcelHalfedge
ArrangementDcelFace
ArrangementDcelHole
ArrangementDcelIsolatedVertex
ArrangementBasicTraits_2
ArrangementLandmarkTraits_2
ArrangementXMonotoneTraits_2
ArrangementTraits_2
ArrangementInputFormatter
ArrangementOutputFormatter
ArrWithHistoryInputFormatter
ArrWithHistoryOutputFormatter
ArrangementPointLocation_2
ArrangementVerticalRayShoot_2
CGAL::Arrangement_2<Traits,Dcel>
CGAL::Arr_accessor<Arrangement>
CGAL::Arr_observer<Arrangement>
CGAL::Arrangement_2<Traits,Dcel>::Vertex
CGAL::Arrangement_2<Traits,Dcel>::Halfedge
CGAL::Arrangement_2<Traits,Dcel>::Face
CGAL::Arr_dcel_base<V,H,F>
CGAL::Arr_default_dcel<Traits>
CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>
CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>
CGAL::Arr_segment_traits_2<Kernel>
CGAL::Arr_non_caching_segment_traits_2<Kernel>
CGAL::Arr_polyline_traits_2<SegmentTraits>
CGAL::Arr_circle_segment_traits_2<Kernel>
CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
CGAL::Arr_rational_arc_traits_2<AlgKernel,NtTraits>
CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>
CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>
CGAL::Arr_text_formatter<Arrangement>
CGAL::Arr_face_extended_text_formatter<Arrangement>
CGAL::Arr_extended_dcel_text_formatter<Arrangement>
CGAL::Arr_with_history_text_formatter<ArrFormatter>
CGAL::Arr_naive_point_location<Arrangement>
CGAL::Arr_walk_along_line_point_location<Arrangement>
CGAL::Arr_trapezoid_ric_point_location<Arrangement>
CGAL::Arr_landmarks_point_location<Arrangement,Generator>
CGAL::is_valid
CGAL::insert_curve
CGAL::insert_curves
CGAL::insert_x_monotone_curve
CGAL::insert_x_monotone_curves
CGAL::insert_non_intersecting_curve
CGAL::insert_non_intersecting_curves
CGAL::insert_point
CGAL::remove_edge
CGAL::remove_vertex
CGAL::locate
CGAL::overlay
CGAL::read
CGAL::write
CGAL::remove_curve