Dual graph partitioning for Bottom-Up BVH construction

Bounding Volume Hierarchies (BVHs) are essential tools in performing collision detection on three-dimensional information. They reduce the number of expensive calculations required to determine whether or not two geometrical entities collide by using inexpensive calculations to rule out parts of the objects that could not possibly intersect. Quickly producing a high quality BVH is an important aspect of three-dimensional multimedia analysis. As such a powerful optimization, efficient and high quality BVHs are still an active area of research. Herein, the authors present a novel BVH representation that reduces the redundancy in the tree structure by allowing a node to contain an arbitrary number of children, as well as compressing non-unique nodes and combining their children. A new partitioning scheme using a graphical representation of the object is also presented to improve the quality of the generated BVH. HighlightsWe present a way to partition triangulated faces for BVH construction.A representation of an AABB tree that exploits a hashmap is examined.BVH representation and partitioning increase quality of BVH.

[1]  Pierre Alliez,et al.  Computational geometry algorithms library , 2008, SIGGRAPH '08.

[2]  Bochang Moon,et al.  RACBVHs: random-accessible compressed bounding volume hierarchies , 2009, SIGGRAPH Talks.

[3]  D. West.  Introduction to Graph Theory , 1995 .

[4]  Dinesh Manocha,et al.  Fast BVH Construction on GPUs , 2009, Comput. Graph. Forum.

[5]  Chaman L. Sabharwal,et al.  Implementation of a divide-and-conquer method for intersection of parametric surfaces , 1985, Comput. Aided Geom. Des..

[6]  B. Walter,et al.  Fast agglomerative clustering for rendering , 2008, 2008 IEEE Symposium on Interactive Ray Tracing.

[7]  Timo Aila,et al.  On quality metrics of bounding volume hierarchies , 2013, HPG '13.

[8]  Thomas Larsson,et al.  Adaptive Bounding Volume Hierarchies for Efficient Collision Queries , 2009 .

[9]  Bochang Moon,et al.  RACBVHs: Random-Accessible Compressed Bounding Volume Hierarchies , 2010, IEEE Trans. Vis. Comput. Graph..

[10]  Chaman L. Sabharwal,et al.  Smooth transition neighborhood graphs for 3D spatial relations , 2013, 2013 IEEE Symposium on Computational Intelligence for Multimedia, Signal and Vision Processing (CIMSIVP).

[11]  Ingo Wald,et al.  Ray tracing deformable scenes using dynamic bounding volume hierarchies , 2007, TOGS.

[12]  Guy E. Blelloch,et al.  Efficient BVH construction via approximate agglomerative clustering , 2013, HPG '13.

[13]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[14]  Ingo Wald,et al.  State of the Art in Ray Tracing Animated Scenes , 2009, Comput. Graph. Forum.

[15]  Chaman L. Sabharwal,et al.  RCC-3D: Qualitative Spatial Reasoning in 3D , 2010, CAINE.

[16]  Pierre Alliez,et al.  CGAL - The Computational Geometry Algorithms Library , 2011 .

[17]  Nathan Eloe,et al.  A More Expressive 3D Region Connection Calculus , 2011, DMS.

[18]  Kellogg S. Booth,et al.  Heuristics for ray tracing using space subdivision , 1990, The Visual Computer.

[19]  Hans-Peter Seidel,et al.  Enhanced automatic creation of multi-purpose object hierarchies , 2000, Proceedings the Eighth Pacific Conference on Computer Graphics and Applications.