Jump to content

Bounding interval hierarchy

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Rehno Lindeque (talk | contribs) at 19:31, 2 September 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A Bounding interval hierarchy is a data structure similar to that of Bounding volume hierarchies. Bounding interval hierarchies are useful for high performance ray tracing and especially dynamic scenes for various reasons.

Some of these are:

  • Very fast construction times
  • Low memory requirements
  • Simple and fast traversal
  • Flat tree structure

References

Papers

Retrieved from "https://en.wikipedia.org/w/index.php?title=Bounding_interval_hierarchy&oldid=73444116"