CGAL::Arr_triangulation_point_location< Arrangement_ > Class Template Reference

#include <CGAL/Arr_triangulation_point_location.h>

Inherits from

Arrangement_::Observer.

Definition

template<typename Arrangement_>
class CGAL::Arr_triangulation_point_location< Arrangement_ >

The Arr_triangulation_point_location class template implements a point-location (and vertical ray-shooting) strategy that is based on triangulation. In particular, the algorithm uses a constrained triangulation, provided by the 2D Triangulations package, as a search structure. Every time the arrangement is modified the constrained triangulation search-structure is reconstructed from scratch, where the edges of the arrangement are set to be the constrained edges of the triangulation. This strategy is inefficient (especially when the number of modifications applied to the arrangement is high) and provided only for educational purposes.

Is model of

ArrangementPointLocation_2

ArrangementVerticalRayShoot_2

See also

ArrangementPointLocation_2

ArrangementVerticalRayShoot_2

CGAL::Arr_point_location_result<Arrangement>