A basic KdTree implementation on 3D datapoint .
Use region_find to find all point in the region specified by (sx, sy, sz) to (tx, ty, tz).
Use nearst_find to find nearst point to the point specified by (x1, y1, z1), r should be larger than the minimum distance.