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 $$w of $$delau that is closest to $$v. If $$v is the only vertex in $$delau , $$NULL is returned.

Requirements

• Dt::Geom_traits
• Dt::Point
• Dt::Vertex_circulator
• Dt::Vertex_handle
• Dt::Geom_traits::Compare_distance_2