Partitioning and Handling Massive Models for Interactive Collision Detection

We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to interactive data access and processing in a large geometric database, which may not fit into main memory of typical desktop workstations or computers. We present a new algorithm using overlap graphs for localizing the “regions of interest” within a massive model, thereby reducing runtime memory requirements. The overlap graph is computed off‐line, pre‐processed using graph partitioning algorithms, and modified on the fly as needed. At run time, we traverse localized sub‐graphs to check the corresponding geometry for proximity and pre‐fetch geometry and auxiliary data structures. To perform interactive proximity queries, we use bounding‐volume hierarchies and take advantage of spatial and temporal coherence. Based on the proposed algorithms, we have developed a system called IMMPACT and used it for interaction with a CAD model of a power plant consisting of over 15 million triangles. We are able to perform a number of proximity queries in real‐time on such a model. In terms of model complexity and application to large models, we have improved the performance of interactive collision detection and proximity computation algorithms by an order of magnitude.

[1]  Michael Cox,et al.  Application-controlled demand paging for out-of-core visualization , 1997 .

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

[3]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[4]  Seth Teller,et al.  Visibility Computations in Densely Occluded Polyhedral Environments , 1992 .

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

[6]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..

[7]  Raimund Seidel,et al.  Linear programming and convex hulls made easy , 1990, SCG '90.

[8]  Stephen Cameron,et al.  A comparison of two fast algorithms for computing the distance between convex polyhedra , 1997, IEEE Trans. Robotics Autom..

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

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

[11]  Ming C. Lin,et al.  Collision Detection between Geometric Models: A Survey , 1998 .

[12]  Dinesh Manocha,et al.  Collision queries using oriented bounding boxes , 2000 .

[13]  David Ellsworth,et al.  Application-controlled demand paging for out-of-core visualization , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

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

[15]  Carlo H. Séquin,et al.  Management of large amounts of data in interactive building walkthroughs , 1992, I3D '92.

[16]  John Rohlf,et al.  IRIS performer: a high performance multiprocessing toolkit for real-time 3D graphics , 1994, SIGGRAPH.

[17]  Carlo H. Séquin,et al.  Interactive simulation of fire in virtual building environments , 1997, SIGGRAPH.

[18]  Seth J. Teller,et al.  Partitioning and ordering large radiosity computations , 1994, SIGGRAPH.

[19]  Philip M. Hubbard,et al.  Interactive collision detection , 1993, Proceedings of 1993 IEEE Research Properties in Virtual Reality Symposium.

[20]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[21]  Elaine Cohen,et al.  A framework for efficient minimum distance computations , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[22]  Brian Mirtich,et al.  V-Clip: fast and robust polyhedral collision detection , 1998, TOGS.

[23]  Stephen Cameron,et al.  Approximation hierarchies and S-bounds , 1991, SMA '91.

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

[25]  Dinesh Manocha,et al.  I-COLLIDE: an interactive and exact collision detection system for large-scale environments , 1995, I3D '95.

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