manolas
/
vcglib
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Improved comment on the order of the returned elements in a kdtree

This commit is contained in:
Paolo Cignoni 2013-01-31 10:44:44 +00:00
parent 8c998ccd11
commit 32423ca043
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
vcg/space/index/kdtree/kdtree.h
View File

@ -165,7 +165,7 @@ void KdTree<Scalar>::setMaxNofNeighbors(unsigned int k)
* a simple stack is by far much faster. * a simple stack is by far much faster.
* *
* The result of the query, the k-nearest neighbors, are internally stored into a stack, where the * The result of the query, the k-nearest neighbors, are internally stored into a stack, where the
* topmost element * topmost element [0] is NOT the nearest but the farthest!! (they are not sorted but arranged into a heap)
*/ */
template<typename Scalar> template<typename Scalar>
void KdTree<Scalar>::doQueryK(const VectorType& queryPoint) void KdTree<Scalar>::doQueryK(const VectorType& queryPoint)