e/Bounding interval hierarchy

Information
has gloss	eng: 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.
lexicalization	eng: Bounding Interval Hierarchy
instance of	c/Geometric algorithms