Lecture 9: Ray Tracing & Acceleration Structures (51)
jananisriram
I'm wondering if this is similar to mipmaps, especially in the sense that the square is subdivided into halves which take up less storage. Is the concept similar, and where can K-D Trees be used?
ninjab3381
is it just me or is point A not at the midpoint of the box like the splitting from previous slides?
I'm wondering if this is similar to mipmaps, especially in the sense that the square is subdivided into halves which take up less storage. Is the concept similar, and where can K-D Trees be used?
is it just me or is point A not at the midpoint of the box like the splitting from previous slides?
https://medium.com/smucs/a-look-into-k-dimensional-trees-290ec69dffe9
this link is quite nice to see the recursive structure of the data structure
I didn't catch this in the slides. How do we split a circle that is in between two boxes? Can a circle only be in one bounding box?