Tighter bounding volumes for better occlusion culling performance

Bounding volumes are used in computer graphics to approximate the actual geometric shape of an object in a scene. The main intention is to reduce the costs associated with visibility or interference tests. The bounding volumes most commonly used have been axis-aligned bounding boxes and bounding spheres. In this paper, we propose the use of discrete orientation polytopes (k-dops) as bounding volumes for the specific use of visibility culling. Occlusion tests are computed more accurately using k-dops, but most importantly, they are also computed more efficiently. We illustrate this point through a series of experiments using a wide range of data models under varying viewing conditions. Although no bounding volume works the best in every situation, k-dops are often the best, and also work very well in those cases where they are not the best, therefore they provide good results without having to analyze applications and different bounding volumes.

[1]  M. Levas.  OBBTree : A Hierarchical Structure for Rapid Interference Detection , .

[2]  Donald P. Greenberg,et al.  Improved Computational Methods for Ray Tracing , 1984, TOGS.

[3]  Subhash Suri,et al.  Analyzing bounding boxes for object intersection , 1999, TOGS.

[4]  Michael Wimmer,et al.  Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful , 2004, Comput. Graph. Forum.

[5]  Turner Whitted,et al.  A 3-dimensional representation for fast rendering of complex scenes , 1980, SIGGRAPH '80.

[6]  Philip M. Hubbard,et al.  Approximating polyhedra with spheres for time-critical collision detection , 1996, TOGS.

[7]  Neil G. Scott,et al.  An overview of the vi- sualize fx graphics accelerator hardware , 1998 .

[8]  Gino van den Bergen.  Efficient Collision Detection of Complex Deformable Models using AABB Trees , 1997, J. Graphics, GPU, & Game Tools.

[9]  Anselmo Lastra,et al.  Fast and Simple Occlusion Culling Using Hardware-based Depth Queries , 2002 .

[10]  James T. Kajiya,et al.  Ray tracing complex scenes , 1986, SIGGRAPH.

[11]  Frédo Durand,et al.  A Survey of Visibility for Walkthrough Applications , 2003, IEEE Trans. Vis. Comput. Graph..

[12]  Taosong He,et al.  Fast collision detection using QuOSPO trees , 1999, SI3D.

[13]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[14]  John Dingliana,et al.  Real-time Collision Detection and Response using Sphere-trees , 1999 .

[15]  Carol O'Sullivan,et al.  Sphere-tree construction using dynamic medial axis approximation , 2002, SCA '02.

[16]  Leonidas J. Guibas,et al.  BOXTREE: A Hierarchical Representation for Surfaces in 3D , 1996, Comput. Graph. Forum.

[17]  Dirk Bartz,et al.  Jupiter: a toolkit for interactive large model visualization , 2001, Proceedings IEEE 2001 Symposium on Parallel and Large-Data Visualization and Graphics (Cat. No.01EX520).

[18]  Subhash Suri,et al.  Analysis of a bounding box heuristic for object intersection , 1999, SODA '99.

[19]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[20]  Joseph S. B. Mitchell,et al.  Real-time collision detection for motion simulation within complex environments , 1996, SIGGRAPH '96.

[21]  Cláudio T. Silva,et al.  Visibility-based prefetching for interactive out-of-core rendering , 2003, IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003..

[22]  Dieter W. Fellner,et al.  Hybrid Scene Structuring with Application to Ray Tracing , 1998 .

[23]  Jarek Rossignac,et al.  Tribox bounds for three-dimensional objects , 1999, Comput. Graph..

[24]  John Salmon,et al.  Automatic Creation of Object Hierarchies for Ray Tracing , 1987, IEEE Computer Graphics and Applications.

[25]  Sergey Zhukov,et al.  On optimality of OBBs for visibility tests for frustum culling, ray shooting and collision detection , 1998, Proceedings. Computer Graphics International (Cat. No.98EX149).

[26]  Dinesh Manocha,et al.  Visibility culling using hierarchical occlusion maps , 1997, SIGGRAPH.

[27]  Frédo Durand,et al.  The visibility skeleton: a powerful and efficient multi-purpose global visibility tool , 1997, SIGGRAPH.

[28]  Dirk Bartz,et al.  Improving occlusion query efficiency with occupancy maps , 2003, IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003..

[29]  Dirk Bartz,et al.  Generation of Decomposition Hierarchies for Efficient Occlusion Culling of Large Polygonal Models , 2001, VMV.

[30]  Dinesh Manocha,et al.  Interactive visibility culling in complex environments using occlusion-switches , 2003, I3D '03.

[31]  Gabriel Zachmann,et al.  Rapid collision detection by dynamically aligned DOP-trees , 1998, Proceedings. IEEE 1998 Virtual Reality Annual International Symposium (Cat. No.98CB36180).

[32]  William J. Schroeder,et al.  Interactive visualization of aircraft and power generation engines , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[33]  Dinesh Manocha,et al.  Rapid and Accurate Contact Determination between Spline Models using ShellTrees , 1998, Comput. Graph. Forum.

[34]  L. Sobierajski,et al.  Interactive visualization of aircraft and power generation engines , 1997 .

[35]  Richard L. Grimsdale,et al.  Collision Detection for Animation using Sphere‐Trees , 1995, Comput. Graph. Forum.

[36]  Sean Quinlan,et al.  Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[37]  Gavin S. P. Miller,et al.  Hierarchical Z-buffer visibility , 1993, SIGGRAPH.

[38]  Beverly Sackler,et al.  Ray Space Factorization for From-Region Visibility , 2002 .

[39]  Dinesh Manocha,et al.  Fast distance queries with rectangular swept sphere volumes , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[40]  Joachim Gudmundsson,et al.  Box-Trees and R-Trees with Near-Optimal Query Time , 2001, SCG '01.

[41]  Joseph S. B. Mitchell,et al.  Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..

[42]  Dirk Bartz,et al.  VIVENDI - A Virtual Ventricle Endoscopy System for Virtual Medicine , 1999 .