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.
Read more about Bounding Interval Hierarchy: Overview, Extensions
Famous quotes containing the words bounding, interval and/or hierarchy:
“Lame as I am, I take the prey,
Hell, earth, and sin with ease o’ercome;
I leap for joy, pursue my way,
And as a bounding hart fly home,
Through all eternity to prove,
Thy nature, and Thy name is Love.”
—Charles Wesley (1707–1788)
“The yearning for an afterlife is the opposite of selfish: it is love and praise for the world that we are privileged, in this complex interval of light, to witness and experience.”
—John Updike (b. 1932)
“In the world of the celebrity, the hierarchy of publicity has replaced the hierarchy of descent and even of great wealth.”
—C. Wright Mills (1916–1962)