Construct KD Tree¶
This node constructs a KD Tree from the input vector list.
KD Trees is a space-partitioning data structure that can be used in multiple spatial searching applications like:
- Find the nearest point to a given point.
- Find points that lie inside a circle of given radius and center.
This data structure is used instead of a traditional nearest neighbor search because it is tremendously faster having a time complexity
of O(n) in the worst case.
- Vector List - A vector list that contain the locations of the points.
- KDTree - The output KDTree.
Advanced Node Settings¶