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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1971-2017
0204019712017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Bounding volume hierarchies (BVH) are a commonly used method for speeding up ray tracing. Even though the memory footprint of a… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 6
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Bounding volume hierarchies (BVH) have become a widely used alternative to kD-trees as the acceleration structure of choice in… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • table 1
Is this relevant?
2008
2008
Efficient tracing of single and incoherent rays is still a challenge in computer graphics. Coherent packet tracing has reached… (More)
  • figure 2
  • figure 3
  • table 1
  • table 2
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The most significant deficiency of most of today's interactive ray tracers is that they are restricted to static walkthroughs… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2006
2006
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2005
2005
A scale space approach is taken for building Bounding Volume Hierarchies (BVHs) for collision detection. A spherical bounding… (More)
Is this relevant?
2000
2000
Bounding Volume Hierarchies are very popular structures for objects storage of virtual scenes. In this article various OO models… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
This paper presents a framework that uses the outputs of model simplification to guide the construction of bounding volume… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Collision detection is of paramount importance for many applications in computer graphics and visualization. Typically, the input… (More)
  • figure 1
  • figure 2
  • table 1
  • table 3
  • table 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We present hierarchical occlusion maps (HOM) for visibility culling on complex models with high depth complexity. The culling… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?