Parallel kd-Tree Based Approach for Computing the Prediction Horizon Using Wolf’s Method

Figure 2

A -dimensional space partitioned using cut planes defined by the dimension containing the maximum spread. In the first stage, the whole space is split using the cut dimension with the cut value . In the second stage, the bottom partition is split using the cut dimension with the cut value , and the top partition is split using the cut dimension with the cut value and so on. Figure 3 shows the kd-tree that represents these partitions.