CGAL::nearest_neighbor
Definition
The function nearest_neighbor is the function template version of the nearest neighbor search on Delaunay
triangulations.
#include <CGAL/nearest_neighbor_delaunay_2.h>
|
template<class Dt>
|
|
Dt::Vertex_handle
|
nearest_neighbor ( Dt delau, Dt::Vertex_handle v)
|
| |
computes a handle to a vertex of that is closest to .
If is the only vertex in , is returned.
|
Requirements
Dt is a CGAL Delaunay triangulation and contains the following subset of types from the concept PointSetTraits and from
the Delaunay triangulation data type:
- Dt::Geom_traits
- Dt::Point
- Dt::Vertex_circulator
- Dt::Vertex_handle
- Dt::Geom_traits::Compare_distance_2
