Kd-Trees an efficient way of doing point location queries. Kd-Trees (in this case 3D-Trees) are a relatively efficient way of doing point location queries. @points: @compare: @Returns: @tree: @bbox: @compare: @Returns: @tree: