|
The Arr_naive_point_location<Arrangement> class implements a na&\iuml;ve 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.
#include <CGAL/Arr_naive_point_location.h>