Skip to search formSkip to main contentSkip to account menu

Bounding volume hierarchy

Known as: BVH, Bvtree, Bounding volume hierarchies 
A bounding volume hierarchy (BVH) is a tree structure on a set of geometric objects. All geometric objects are wrapped in bounding volumes that form… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We propose two hardware mechanisms to decrease energy consumption on massively parallel graphics processors for ray tracing… 
2010
2010
Bounding volume hierarchies (BVH) are a commonly used method for speeding up ray tracing. Even though the memory footprint of a… 
2010
2010
Streszczenie. W artykule opisano problem generacji hierarchii brył ograniczających zastosowanych do wykrywania kolizji w scenach… 
2009
2009
We introduce a bounding volume hierarchy based on the Slab Cut Ball. This novel type of enclosing shape provides an attractive… 
2008
2008
  • Andrew Kensler
  • 2008
  • Corpus ID: 2120988
Current top-down algorithms for constructing bounding volume hierarchies (BVHs) using the surface area heuristic (SAH) rely on an… 
2006
2006
In this paper, we describe how meta-data of indexation can be extracted from historical document images using an interactive… 
2003
2003
A bounding volume hierarchy is a common method for making ray tracing based rendering more efficient. Constructing good… 
1982
1982
Many quantitative models have been developed and tried in the R&D management environment. Although very successful in providing…