bounding volume hierarchy , BHV (skrót)

Bounding volume hierarchies are used to support several operations on sets of geometric objects efficiently, such as in collision detection.

A bounding volume hierarchy (BVH) is a tree structure on a set of geometric objects.

By arranging the bounding volumes into a bounding volume hierarchy, the time complexity can be reduced to logarithmic in the number of tests performed.

Scene graphs and bounding volume hierarchies (BVHs)

Bounding volume hierarchy, also known as Boundary Volume Tree (BVT).

A bounding interval hierarchy (BIH) is a partitioning data structure similar to that of bounding volume hierarchies or kd-trees.

Bounding Volume Hierarchies (BVHs) are useful for numerous tasks - including efficient culling and speeding up collision detection between objects.

Bounding volume hierarchies (AABB trees, OBB trees, sphere trees)

Bounding volume hierarchies (BVHs) are often used to subdivide the scene's space (examples are the BSP tree, the octree and the kd-tree).

Bounding interval hierarchies (BIH) exhibit many of the properties of both bounding volume hierarchies (BVH) and kd-trees.

To obtain bounding volumes of complex objects, a common way is to break the objects/scene down using a scene graph or more specifically bounding volume hierarchies like e.g. OBB trees.