Merry, BruceGain, JamesMarais, PatrickM.- A. Otaduy and O. Sorkine2014-01-262014-01-2620131017-4656https://doi.org/10.2312/conf/EG2013/short/037-040Finding the k nearest neighbours of each point in a point cloud forms an integral part of many point-cloud processing tasks. One common approach is to build a kd-tree over the points and then iteratively query the k nearest neighbors of each point. We introduce a simple modification to these queries to exploit the coherence between successive points; no changes are required to the kd-tree data structure. The path from the root to the appropriate leaf is updated incrementally, and backtracking is done bottom-up. We show that this can reduce the time to compute the neighbourhood graph of a 3D point cloud by over 10%, and by up to 24% when kI.3.5 [Computer Graphics]Computational Geometry and Object ModelingObject hierarchies