This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License
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.
| Property | Value |
|---|---|
| dbo:abstract |
|
| dbo:wikiPageExternalLink | |
| dbo:wikiPageID |
|
| dbo:wikiPageLength |
|
| dbo:wikiPageRevisionID |
|
| dbo:wikiPageWikiLink |
|
| dcterms:subject | |
| gold:hypernym | |
| rdf:type | |
| rdfs:comment |
|
| rdfs:label |
|
| owl:sameAs | |
| prov:wasDerivedFrom | |
| foaf:isPrimaryTopicOf | |
| is dbo:wikiPageDisambiguates of | |
| is dbo:wikiPageRedirects of | |
| is dbo:wikiPageWikiLink of | |
| is foaf:primaryTopic of |