Metraipolis › archive › dc_5aa6f5abc14d

Bounding volume hierarchy — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Bounding_volume_hierarchy
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T00:02:16.422Z
SHA-256 of the archived text
8b8ef54a6e3567e5ed6910a3743c8828ec2fc6348d8f6b9546a06b5ccaf33b6a
Stable URL of this page
https://metraipolis.com/documento/dc_5aa6f5abc14d

How to cite

Bounding volume hierarchy — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Bounding_volume_hierarchy (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_5aa6f5abc14d (Metraipolis archive dc_5aa6f5abc14d, sha256 8b8ef54a6e3567e5ed6910a3743c8828ec2fc6348d8f6b9546a06b5ccaf33b6a)
BibTeX
@misc{dc5aa6f5abc14d,
  title = {Bounding volume hierarchy — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Bounding_volume_hierarchy},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_5aa6f5abc14d; sha256 8b8ef54a6e3567e5ed6910a3743c8828ec2fc6348d8f6b9546a06b5ccaf33b6a},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Bounding_volume_hierarchy. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A bounding volume hierarchy (BVH) is a tree structure on a set of geometric objects. All geometric objects, which form the leaf nodes of the tree, are wrapped in bounding volumes. These nodes are then grouped as small sets and enclosed within larger bounding volumes. These, in turn, are also grouped and enclosed within other larger bounding volumes in a recursive fashion, eventually resulting in a tree structure with a single bounding volume at the top of the tree. Bounding volume hierarchies are used to support several operations on sets of geometric objects efficiently, such as in collision detection and ray tracing. Although wrapping objects in bounding volumes and performing collision tests on them before testing the object geometry itself simplifies the tests and can result in significant performance improvements, the same number of pairwise tests between bounding volumes are still being performed. By arranging the bounding volumes into a bounding volume hierarchy, the time complexity (the number of tests performed) can be reduced to logarithmic in the number of objects. With such a hierarchy in place, during collision testing, child volumes do not have to be examined if their parent volumes are not intersected (for example, if the bounding volumes of two bumper cars do not intersect, the bounding volumes of the bumpers themselves need not be checked for collision).

Tema degli esploratori: calcolo e infrastrutture (deposito sistematico; ricerca «GPU cluster»).
Fonte: Wikipedia in inglese, voce «Bounding volume hierarchy» — https://en.wikipedia.org/wiki/Bounding_volume_hierarchy
Wikidata Q4950000 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4950000
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Bounding_volume_hierarchy?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1375585542, consultata il 2026-10-05T23:26:02.555Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: eb6dc6316ad08220985576ccc213e44c6aca3ba9f455c2d046b21bd7a9241e60