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)

Related topics

Related topics

21 relations

Broader (1)

3D computer graphics
Binary space partitioningBounding interval hierarchyBounding volumeCollision detection

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Efficient offset trimming for deformable planar curves using a dynamic hierarchy of bounding circular arcs
2010
2010
BOUNDING VOLUME HIERARCHIES FOR COLLISION DETECTION
Streszczenie. W artykule opisano problem generacji hierarchii brył ograniczających zastosowanych do wykrywania kolizji w scenach… 
2009
2009
Adaptive Bounding Volume Hierarchies for Efficient Collision Queries
The need for efficient interference detection frequently arises in computer graphics, robotics, virtual prototyping, surgery… 
2008
2008
Tree rotations for improving bounding volume hierarchies
  • Andrew Kensler
  • IEEE Symposium on Interactive Ray Tracing
  • 2008
  • Corpus ID: 2120988
Current top-down algorithms for constructing bounding volume hierarchies (BVHs) using the surface area heuristic (SAH) rely on an… 
2007
2007
A Volumetric Bounding Volume Hierarchy for Collision Detection
Existing BVHs are restricted to surface-based hierarchical decomposition, which lose the inner space properties of object and… 
2006
2006
AGORA: the interactive document image analysis tool of the BVH project
In this paper, we describe how meta-data of indexation can be extracted from historical document images using an interactive… 
2003
2003
Interaction-free dressing of virtual humans
2000
2000
Bounding Volume Hierarchy Analysis (Case Study)
Bounding Volume Hierarchies are very popular structures for objects storage of virtual scenes. In this article various OO models… 
1986
1986
Minplex - A Compactor that Minimizes the Bounding Rectangle and Individual Rectangles in a Layout
This paper presents a graph-theoretic compactor that minimizes the areas of the bounding rectangle and the individual rectangles… 
1982
1982
A unified approach to the acquisition of subjective data in R&D
Many quantitative models have been developed and tried in the R&D management environment. Although very successful in providing… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)