Since the KD-tree has more flexibility to choose the splits, does it mean that KD-tree generally performs better than Oct-Tree? Does this comparison also apply to KD-Tree and BSP-Tree? I wonder if there is any case that one would choose Oct-Tree over KD-Tree.
selinafeng
How would you decide which spatial partitioning variant to use? Are there memory tradeoffs for keeping track of more complex variants like the BSP tree compared to the Oct tree?
nadiahyder
are these partitioned in a pre-determined way?
alexkassil
oct is repeatedly split in hal, kd tree is cut by median vertically then horizontaly and keep repeating, and you can read about bsp-tree here Binary_space_partitioning
Since the KD-tree has more flexibility to choose the splits, does it mean that KD-tree generally performs better than Oct-Tree? Does this comparison also apply to KD-Tree and BSP-Tree? I wonder if there is any case that one would choose Oct-Tree over KD-Tree.
How would you decide which spatial partitioning variant to use? Are there memory tradeoffs for keeping track of more complex variants like the BSP tree compared to the Oct tree?
are these partitioned in a pre-determined way?
oct is repeatedly split in hal, kd tree is cut by median vertically then horizontaly and keep repeating, and you can read about bsp-tree here Binary_space_partitioning
https://en.wikipedia.org/wiki/Binary_space_partitioning