Navigation: Up   Table of Contents   Package Overview   Bibliography   Index   Title   Acknowledging CGAL
Function

CGAL::nearest_neighbors

Definition

The function nearest_neighbors is the function template version of the k nearest neighbors search on Delaunay triangulations. There are two versions of this function, one taking a point of the Delaunay triangulation and the other taking a vertex handle.

#include <CGAL/nearest_neighbor_delaunay_2.h>

template<class Dt, class OutputIterator>
OutputIterator nearest_neighbors ( Dt& delau, Dt::Point p, Dt::size_type k, OutputIterator res)
computes the k nearest neighbors of p in delau, and places the handles to the corresponding vertices as a sequence of objects of type Vertex_handle in a container of value type of res which points to the first object in the sequence. The function returns an output iterator pointing to the position beyond the end of the sequence.

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:

template<class Dt, class OutputIterator>
OutputIterator nearest_neighbors ( Dt& delau, Dt::Vertex_handle v, Dt::size_type k, OutputIterator res)
computes the k nearest neighbors of v (including v) in delau, and places them as a sequence of objects of type Vertex_handle in a container of value type of res which points to the first object in the sequence. The function returns an output iterator pointing to the position beyond the end of the sequence.

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:
Next: range_search
Navigation: Up   Table of Contents   Package Overview   Bibliography   Index   Title   Acknowledging CGAL
CGAL Open Source Project. Release 4.1. 23 October 2012.