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)
“I was interested to see how a pioneer lived on this side of the country. His life is in some respects more adventurous than that of his brother in the West; for he contends with winter as well as the wilderness, and there is a greater interval of time at least between him and the army which is to follow. Here immigration is a tide which may ebb when it has swept away the pines; there it is not a tide, but an inundation, and roads and other improvements come steadily rushing after.”
—Henry David Thoreau (1817–1862)
“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)