| advanced |

## CGAL::Pm_naive_point_location<Planar_map>

The Pm_naive_point_location<Planar_map> class implements the naive algorithm which goes over all the vertices and halfedges of the planar map. Therefore, the time complexity of a query is linear in the complexity of the planar map. Since it does not use an additional structure, the updating operations are empty and therefore modifying operations such as split_edge and merge_edge take constant time.

#include <CGAL/Pm_naive_point_location.h>

### Is Model for the Concept

PlanarMapPointLocation_2

### Inherits From

Pm_point_location_base<Planar_map>

### See Also

Discussion of the different point location strategies in the introduction of Planar_map reference pages.

| advanced |