K-dimensional trees, abbreviated as k-d trees in the following, are binary search and partitioning trees that represent a set of n points in a multi-dimensional space.

Key Method

In the application developed in this project the k-d tree algorithm is initially used to subdivide a given rectangular area.

The dividing lines thereby correspond to eventual spatial boundaries.