\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.6 - 2D Range and Neighbor Search
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL Namespace Reference

Classes

class  Point_set_2
 An instance PS of the data type Point_set_2 is a Delaunay Triangulation of its vertex set. More...
 

Functions

template<class Dt >
Dt::Vertex_handle nearest_neighbor (const Dt &delau, Dt::Vertex_handle v)
 computes a handle to a vertex w of delau that is closest to v. More...
 
template<class Dt , class OutputIterator >
OutputIterator nearest_neighbors (Dt &delau, const 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. More...
 
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. More...
 
template<class Dt , class Circle , class OutputIterator >
OutputIterator range_search (Dt &delau, const Circle &C, OutputIterator res)
 computes handles to all vertices contained in the closure of disk C. More...
 
template<class Dt , class OutputIterator >
OutputIterator range_search (Dt &delau, const Dt::Point &a, const Dt::Point &b, const Dt::Point &c, OutputIterator res)
 computes handles to all vertices contained in the closure of the triangle (a,b,c). More...
 
template<class Dt , class OutputIterator >
OutputIterator range_search (Dt &delau, const Dt::Point &a, const Dt::Point &b, const Dt::Point &c, const Dt::Point &d, OutputIterator res)
 computes handles to all vertices contained in the closure of the iso-rectangle (a,b,c,d). More...
 
template<class Dt , class Circle , class OutputIterator , class Pred >
OutputIterator range_search (Dt &delau, const Circle &C, OutputIterator res, Pred &pred, bool return_if_succeded)
 computes handles to all vertices contained in the closure of disk C. More...
 
template<class Dt , class OutputIterator , class Pred >
OutputIterator range_search (Dt &delau, const Dt::Point &a, const Dt::Point &b, const Dt::Point &c, OutputIterator res, Pred &pred, bool return_if_succeded)
 computes handles to all vertices contained in the closure of the triangle (a,b,c). More...
 
template<class Dt , class OutputIterator , class Pred >
OutputIterator range_search (Dt &delau, const Dt::Point &a, const Dt::Point &b, const Dt::Point &c, const Dt::Point &d, OutputIterator res, Pred &pred, bool return_if_succeded)
 computes handles to all vertices contained in the closure of the iso-rectangle (a,b,c,d). More...