CGAL 5.1.2 - 2D Arrangements
CGAL::Arr_naive_point_location< Arrangement > Class Template Reference

#include <CGAL/Arr_naive_point_location.h>

Definition

The Arr_naive_point_location class implements a naive algorithm that traverses all the vertices and halfedges in the arrangement in search for an answer to a point-location query. The query time is therefore linear in the complexity of the arrangement. Naturally, this point-location strategy could turn into a heavy time-consuming process when applied to dense arrangements.

Is Model Of:

ArrangementPointLocation_2

ArrangementVerticalRayShoot_2

See also
ArrangementPointLocation_2
ArrangementVerticalRayShoot_2
CGAL::Arr_point_location_result<Arrangement>
CGAL_ARR_POINT_LOCATION_VERSION
Examples:
Arrangement_on_surface_2/conic_multiplicities.cpp, Arrangement_on_surface_2/global_insertion.cpp, Arrangement_on_surface_2/global_removal.cpp, and Arrangement_on_surface_2/point_location_example.cpp.