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)
“[I have] been in love with one princess or another almost all my life, and I hope I shall go on so, till I die, being firmly persuaded, that if ever I do a mean action, it must be in some interval betwixt one passion and another.”
—Laurence Sterne (1713–1768)
“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)