Bounding interval hierarchy
id:
bounding-interval-hierarchy-178-14651150
title:
Bounding interval hierarchy
text:
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 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.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Bounding_interval_hierarchy
date created:
2006-09-02T19:31:51Z
date modified:
2024-09-04T17:12:27Z
main entity:
{"identifier":"Q4949996","url":"https://www.wikidata.org/entity/Q4949996"}
image:
fields total:
13
integrity:
14