BVH

A BVH is a standard spatial data structure for accelerating intersection tests in ray tracing, reducing naive O(n) traversal to approximately O(log n).

The core component of VisibilitySplat is a point-based ray tracer, accelerated with a BVH, used to estimate the transmittance-weighted occlusion of Gaussian primitives under sampled lighting directions.

BVH reduces intersection complexity from O(n) to O(log n), and the absence of BVH causes rendering errors such as object penetration.

BVH reduces ray-intersection complexity from O(n) to O(log n) and is the core data structure for accelerating ray intersection.

In a WebGL path-tracing test, OPS occluders lack a hierarchical relationship (missing BVH acceleration structure), causing objects to be rendered directly through boundaries.

BVH (Bounding Volume Hierarchy) recursively wraps scene geometry with axis-aligned bounding boxes to form a binary tree, reducing ray intersection complexity from O(n) to O(log n).

The OPS version's path tracing lacks a BVH acceleration structure, resulting in occluders having no hierarchical relationships and objects passing directly through boundaries.

The WebGL ray-traced occluders in OPS lack a hierarchical structure (missing a BVH acceleration structure), causing objects to directly pass through boundaries.

In the WebGL path tracing test, OPS lacked a BVH acceleration structure, causing objects to display through boundaries.

BVH (Bounding Volume Hierarchy) can reduce ray intersection complexity from O(n) to O(log n).