CGAL 5.4.4  2D Arrangements

#include <CGAL/Arr_naive_point_location.h>
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 pointlocation query. The query time is therefore linear in the complexity of the arrangement. Naturally, this pointlocation strategy could turn into a heavy timeconsuming process when applied to dense arrangements.