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:
“I fell her finger light
Laid pausefully upon life’s headlong train;—
The foot less prompt to meet the morning dew,
The heart less bounding at emotion new,
And hope, once crush’d, less quick to spring again.”
—Matthew Arnold (1822–1888)
“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 a hierarchy every employee tends to rise to his level of incompetence.”
—Laurence J. Peter (1919–1990)