I don't understand how this can be done in front-to-back order?
tbell
Since in this case partitions are strictly disjoint in space and we know the boundaries exactly, we know that if we find an intersection in a closer partition that it will necessarily be in front of an intersection in a farther one, so we can stop early.
chaonanye
More details: https://en.wikipedia.org/wiki/K-d_tree
K-D stands for k-dimensional
I don't understand how this can be done in front-to-back order?
Since in this case partitions are strictly disjoint in space and we know the boundaries exactly, we know that if we find an intersection in a closer partition that it will necessarily be in front of an intersection in a farther one, so we can stop early.
More details: https://en.wikipedia.org/wiki/K-d_tree