 The BIH was first presented under the name of SKD-Trees, presented by Ooi et al., and BoxTrees, independently invented by Zachmann.Bounding interval hierarchies (BIH) exhibit many of the properties of both bounding volume hierarchies (BVH) and kd-trees.Whereas the construction and storage of BIH is comparable to that of BVH, the traversal of BIH resemble that of kd-trees.