Sat, 24 Nov 2007 21:55:41 +0100 Radek Brich kd-tree: traversal algorithm (KdTree::nearest_intersection) pyrit
(0) -10 -1 +1 +10 +30 tip