CSE 167 Lecture Notes - Lecture 16: Bounding Volume Hierarchy, Bounding Volume, Octree
5 Mar 2019
School
Department
Course
Professor
Document Summary
Bounding volume hierarchies: build hierarchy of bounding volumes. Bounding volume of interior node contains all children: use hierarchy to accelerate ray intersections. Intersect node contents only if hit bounding volume. If (min_t < bv_t[i]) break; (min t is less than bounding volume of t) Min_t = shape_t: sort hits & detect early termination. Beam tracing (trace a beam through the pixel) Binary space partitioning (bsp trees) t = (x0 - p0x) / p1x. Bbleft x = x0 txmax (xmax) txmin (xmin) tymax (ymax) tymin (ymin) tzmin (zmin) tzmin (zmin) The ranges in which the rays goes through must intersect (i. e. the x and y min and max ranges must intersect for there to be an intersection!) If txmin > tymax or tymin > txmax. Creating bounding volume hierarchy function bvh-node::create (object array a, int axis) Find midpoint m of bounding box of a along axis. Partition a into lists of size k and n-k around m.
