Would that large triangle in the center correspond to just a single node or multiple nodes? (The triangle that's in the pink, green purple, and orange boxes)
simply_complicated
How is the K-D tree actually constructed? How do you know where to partition space?
Max
@Ace the large triangle would most likely be referred to by every node it intersects.
@simply_complicated assuming you don't want to compute the optimal solution minimizing some metric, you can use heuristics. For example, you could sort the primitives into buckets and choose a split plane that partitions the buckets equally.
rmvenkat
Are there any drawbacks which KD-tree has, when compared to BVH?
Zhuoqian
These look a lot like decision-trees' decision boundaries.
Would that large triangle in the center correspond to just a single node or multiple nodes? (The triangle that's in the pink, green purple, and orange boxes)
How is the K-D tree actually constructed? How do you know where to partition space?
@Ace the large triangle would most likely be referred to by every node it intersects.
@simply_complicated assuming you don't want to compute the optimal solution minimizing some metric, you can use heuristics. For example, you could sort the primitives into buckets and choose a split plane that partitions the buckets equally.
Are there any drawbacks which KD-tree has, when compared to BVH?
These look a lot like decision-trees' decision boundaries.