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

CGAL 6.1.2 - 2D Arrangements

Loading...
Searching...
No Matches
CGAL::Arr_naive_point_location< Arrangement > Class Template Reference
Reference Manual » Point Location

`#include <CGAL/Arr_naive_point_location.h>`

## Definition

template<typename Arrangement>
class CGAL::Arr_naive_point_location< Arrangement >

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
  `AosPointLocation_2`
  `AosVerticalRayShoot_2`

See also
  `AosPointLocation_2`
  `AosVerticalRayShoot_2`
  `CGAL::Arr_point_location_result<Arrangement>`

Examples
  Arrangement_on_surface_2/conic_multiplicities.cpp, Arrangement_on_surface_2/incremental_insertion.cpp, and Arrangement_on_surface_2/point_location.cpp.