#include <numeric/types.hh>
#include <numeric/kdtree/constants.hh>
#include <numeric/kdtree/nearest_neighbors.hh>
#include <numeric/kdtree/util.hh>
#include <numeric/kdtree/calc_distance.hh>
#include <numeric/kdtree/KDNode.hh>
#include <numeric/kdtree/KDTree.hh>
#include <numeric/kdtree/HyperRectangle.hh>
#include <utility/vector1.hh>
#include <utility/pointer/ReferenceCount.hh>
#include <utility/pointer/ReferenceCount.fwd.hh>
#include <cmath>
#include <algorithm>

Namespaces
	numeric
	Unit headers.

	numeric::kdtree

Functions
void	numeric::kdtree::nearest_neighbor (KDTree &tree, utility::vector1< numeric::Real > const &pt,KDNodeOP &nearest, numeric::Real &dist_sq)
	Searches the KDtree for the nearest neigbor to a given input point, returns nearest neighbor and distance-squared to nearest neigbor by reference. More...

KDPointList	numeric::kdtree::nearest_neighbors (KDTree &tree, utility::vector1< numeric::Real > const &pt, Size const wanted)
	Returns a KDPointList of the N nearest neighbors from the KDTree to the given input point. More...

KDPointList	numeric::kdtree::nearest_neighbors (KDTree &tree, utility::vector1< numeric::Real > const &pt, Size const wanted, numeric::Real const max_dist_allowed)

void	numeric::kdtree::nearest_neighbors (KDNodeOP &current, utility::vector1< numeric::Real > const &pt, HyperRectangle &bounds, numeric::Real max_dist_sq,KDPointList &neighbors)
	Recursive function definition for search for a list of the N nearest neighbors, where N is defined as a member variable of the KDPointList object. More...

void	numeric::kdtree::nearest_neighbor (KDNodeOP &current, utility::vector1< numeric::Real > const &pt, HyperRectangle &bounds, numeric::Real max_dist_sq,KDNodeOP &nearest, numeric::Real &dist_sq)
	returns the nearest neighbor to the given point. More...

Namespaces

Functions