IMP::algebra::NearestNeighborD< D > Class Template Reference

---

Detailed Description

template<unsigned int D>
class IMP::algebra::NearestNeighborD< D >

Build a structure for finding nearest neighbors. This is quite slow without CGAL. {}

Public Member Functions
unsigned int	get_nearest_neighbor (unsigned int i) const
unsigned int	get_nearest_neighbor (const VectorD< D > &q) const
Ints	get_nearest_neighbors (unsigned int i, unsigned int k) const
	NearestNeighborD (const std::vector< VectorD< D > > &vs, double epsilon=0)

---

Member Function Documentation

template<unsigned int D>

unsigned int IMP::algebra::NearestNeighborD< D >::get_nearest_neighbor

(

unsigned int

i

)

const

Search using the ith point in the input set.

template<unsigned int D>

Ints IMP::algebra::NearestNeighborD< D >::get_nearest_neighbors	(	unsigned int	i,
		unsigned int	k
	)			const

Search using the ith point in the input set. Return the k nearest neighbors.

---

The documentation for this class was generated from the following file:

• vector_search.h