K-neighbor Searching of Surface Reconstruction From Scattered Points
Xi Yanjun · Microelectronics & Computer · 2006
In this paper, a method to find the k-neighbor of points very quickly which is based on octree,is provided. K-neighbor searching method builds up the envelopment-box of points first, then divides the box and records the dividing process by octree. This method limits the searching range to the point's envelopment-box and its neighbor boxes, and reduces the searching range ulteriorly by pruning means. This method has some excellent characters such as quick speed, automatic deleting of yawp points.