Bounding interval hierarchy
A bounding interval hierarchy (BIH) is a partitioning data structure similar to that of bounding volume hierarchies or kd-trees. Bounding interval hierarchies can be used in high performance (or real-time) ray tracing and may be especially useful for dynamic scenes. The BIH was first presented under the name of SKD-Trees, presented by Ooi et al., and BoxTrees, independently invented by Zachmann.
Wikipage disambiguates
Wikipage redirect
primaryTopic
Bounding interval hierarchy
A bounding interval hierarchy (BIH) is a partitioning data structure similar to that of bounding volume hierarchies or kd-trees. Bounding interval hierarchies can be used in high performance (or real-time) ray tracing and may be especially useful for dynamic scenes. The BIH was first presented under the name of SKD-Trees, presented by Ooi et al., and BoxTrees, independently invented by Zachmann.
has abstract
A bounding interval hierarchy ...... endently invented by Zachmann.
@en
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
738,697,525
hypernym
type
comment
A bounding interval hierarchy ...... endently invented by Zachmann.
@en
label
Bounding interval hierarchy
@en