SPAR/AIModule/BWTA/vendors/CGAL/CGAL/nearest_neighbor_delaunay_2.h File Reference

#include <CGAL/basic.h>
#include <CGAL/Unique_hash_map.h>
#include <CGAL/Delaunay_triangulation_2.h>
#include <CGAL/squared_distance_2_1.h>
#include <CGAL/compare_vertices.h>
#include <list>
#include <queue>
#include <map>
#include <stack>
#include <cmath>

Include dependency graph for nearest_neighbor_delaunay_2.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
template<class Dt >
CGAL_BEGIN_NAMESPACE Dt::Vertex_handle	nearest_neighbor (const Dt &delau, typename Dt::Vertex_handle v)
template<class Dt >
Dt::Vertex_handle	lookup (const Dt &delau, const typename Dt::Point &p)
template<class Dt , class OutputIterator >
OutputIterator	nearest_neighbors (Dt &delau, const typename Dt::Point &p, int k, OutputIterator res)
template<class Dt , class OutputIterator >
OutputIterator	nearest_neighbors (const Dt &delau, typename Dt::Vertex_handle v, int k, OutputIterator res)
template<class Dt , class OutputIterator >
OutputIterator	get_vertices (const Dt &delau, OutputIterator res)
template<class Dt , class T2 >
void	nearest_neighbors_list (const Dt &delau, typename Dt::Vertex_handle v, int k, std::list< T2 > &res)

---

Function Documentation

template<class Dt , class OutputIterator >

OutputIterator get_vertices	(	const Dt &	delau,
		OutputIterator	res
	)

Here is the call graph for this function:

Here is the caller graph for this function:

template<class Dt >

Dt::Vertex_handle lookup	(	const Dt &	delau,
		const typename Dt::Point &	p
	)

Here is the caller graph for this function:

template<class Dt >

CGAL_BEGIN_NAMESPACE Dt::Vertex_handle nearest_neighbor	(	const Dt &	delau,
		typename Dt::Vertex_handle	v
	)

Here is the caller graph for this function:

template<class Dt , class OutputIterator >

OutputIterator nearest_neighbors	(	Dt &	delau,
		const typename Dt::Point &	p,
		int	k,
		OutputIterator	res
	)

Here is the call graph for this function:

template<class Dt , class OutputIterator >

OutputIterator nearest_neighbors	(	const Dt &	delau,
		typename Dt::Vertex_handle	v,
		int	k,
		OutputIterator	res
	)

Here is the call graph for this function:

template<class Dt , class T2 >

void nearest_neighbors_list	(	const Dt &	delau,
		typename Dt::Vertex_handle	v,
		int	k,
		std::list< T2 > &	res
	)

Here is the call graph for this function:

Here is the caller graph for this function: