CSDL Home IEEE Transactions on Visualization & Computer Graphics 2008 vol.14 Issue No.01 - January/February

Subscribe

Issue No.01 - January/February (2008 vol.14)

pp: 1-12

ABSTRACT

We propose an acceleration scheme for manybody dynamic collision detection at interactive rates. We use the VADOP, a tight bounding volume representation that offers fast update rates and which is particularly suitable for applications with many fast-moving objects. The axes selection that determines the shape of our bounding volumes is based on spherical coverings. We demonstrate that we can robustly detect collisions that are missed by pseudo-dynamic collision detection schemes, with even greater performance due to substantial collision pruning by our bounding volumes.

INDEX TERMS

collision detection, continuous collision detection, dynamic collision detection, physically-based modeling, boundary representations, virtual reality

CITATION

Daniel S. Coming, Oliver G. Staadt, "Velocity-Aligned Discrete Oriented Polytopes for Dynamic Collision Detection",

*IEEE Transactions on Visualization & Computer Graphics*, vol.14, no. 1, pp. 1-12, January/February 2008, doi:10.1109/TVCG.2007.70405REFERENCES

- [1] G. Zachmann, “Optimizing the Collision Detection Pipeline,”
Proc. First Int'l Game Technology Conf. (GTEC '01), 2001.- [3] D. Eberly, “Intersection of Convex Objects: The Method of Separating Axes,” http://geometrictools.com/DocumentationMethodOfSeparatingAxes.pdf , 2001.
- [7] J. Eckstein and E. Schömer, “Dynamic Collision Detection in Virtual Reality Applications,”
Proc. Seventh Int'l Conf. Central Europe on Computer Graphics, Visualization, and Interactive Digital Media (WSCG '99), pp. 71-78, 1999.- [9] C. O'Sullivan and J. Dingliana, “Real-Time Collision Detection and Response Using Sphere Trees,”
Proc. 15th Spring Conf. Computer Graphics (SCCG '99), pp. 83-92, Apr. 1999.- [10] M. Held, J.T. Klosowski, and J.S.B. Mitchell, “Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs,”
Proc. Seventh Canadian Conf. Computational Geometry (CCCG '95), pp. 205-210, Aug. 1995.- [11] J.D. Cohen, M.C. Lin, D. Manocha, and M.K. Ponamgi, “I-COLLIDE: An Interactive and Exact Collision Detection System for Large-Scale Environments,”
Proc. Symp. Interactive 3D Graphics (SI3D '95), pp. 189-196, 1995.- [12] G. van den Bergen,
Collision Detection in Interactive 3D Environments, The Morgan Kaufmann Series in Interactive 3D Technology, vol. 1, Morgan Kaufmann, 2003.- [13] G. Zachmann, “Minimal Hierarchical Collision Detection,”
Proc. Ninth ACM Symp. Virtual Reality Software and Technology (VRST '02), pp. 121-128, 2002.- [14] C. Fünfzig and D.W. Fellner, “Easy Realignment of k-DOP Bounding Volumes,”
Proc. Graphics Interface '03, pp. 257-264, June 2003.- [15] G. Zachmann, “Rapid Collision Detection by Dynamically Aligned DOP-Trees,”
Proc. IEEE Virtual Reality Ann. Int'l Symp. (VRAIS '98), pp. 90-97, 1998.- [17] D. Eberly, “Dynamic Collision Detection Using Oriented Bounding Boxes,” http://geometrictools.com/DocumentationDynamicCollisionDetection.pdf , 1999.
- [20] S.A. Gottschalk, M.C. Lin, and D. Manocha, “OBBTree: A Hierarchical Structure for Rapid Interference Detection,”
Proc. ACM SIGGRAPH '96, pp. 171-180, 1996.- [21] G. van den Bergen, “Efficient Collision Detection of Complex Deformable Models Using AABB Trees,”
J. Graphics Tools, vol. 2, no. 4, pp. 1-13, 1997.- [22] D.S. Coming and O.G. Staadt, “Velocity-Aligned Discrete Oriented Polytopes for Dynamic Collision Detection,” Technical Report CSE-2004-25, Dept. of Computer Science, Univ. of California, Davis, Sept. 2004.
- [23] G. Sobottka and A. Weber, “Efficient Bounding Volume Hierarchies for Hair Simulation,”
Proc. Second Workshop Virtual Reality Interactions and Physical Simulations (VRIPHYS '05), pp. 101-110, 2005.- [25] G. van den Bergen, “A Fast and Robust GJK Implementation for Collision Detection of Convex Objects,”
J. Graphics Tools, vol. 4, no. 2, pp. 7-25, 1999.- [26] G. van den Bergen, “Proximity Queries and Penetration Depth Computation on 3D Game Objects,”
Proc. Game Developers Conf., 2001.- [27] S.A. Ehmann and M.C. Lin, “Accurate and Fast Proximity Queries between Polyhedra Using Surface Decomposition,”
Computer Graphics Forum, vol. 20, no. 3, pp. 500-510, 2001.- [28] M.C. Lin and J.F. Canny, “Efficient Algorithms for Incremental Distance Computation,”
Proc. IEEE Conf. Robotics and Automation (ICRA '91), pp. 1008-1014, 1991.- [29] G. van den Bergen, “Ray Casting against General Convex Objects with Application to Continuous Collision Detection,”
J. Graphics Tools, http://dtecta.com/papersjgt04raycast.pdf , June 2004.- [30] D.S. Coming and O.G. Staadt, “Kinetic Sweep and Prune for Multi-Body Continuous Motions,”
Computers and Graphics, vol. 30, no. 3, May 2006.- [31] C. Lennerz, E. Schömer, and T. Warken, “A Framework for Collision Detection and Response,”
Proc. 11th European Simulation Symp. (ESS '99), pp. 309-314, 1999.- [34] J. Basch, J. Erickson, L.J. Guibas, J. Hershberger, and L. Zhang, “Kinetic Collision Detection between Two Simple Polygons,”
Computational Geometry: Theory and Applications, vol. 27, no. 3, pp.211-235, 2004.- [35] R.H. Hardin, N.J.A. Sloane, and W.D. Smith, “Spherical Codes,” www.research.att.com/njascoverings, 1994.
- [36] R.H. Hardin, N.J.A. Sloane, and W.D. Smith, “Tables of Spherical Codes with Icosahedral Symmetry,” www.research.att.com/njasicosahedral.codes , 1994.
- [37] S. Redon, “Fast Continuous Collision Detection and Handling for Desktop Virtual Prototyping,”
Proc. IEEE Virtual Reality Conf. (VR'04), vol. 8, no. 1, p. 63, Mar. 2004.- [39] D. Eberly, “Intersection of Objects with Linear and Angular Velocities Using Oriented Bounding Boxes,” http://geometric tools.com/Documentation IntersectionRotatingBoxes.pdf, 1999.
- [41] F. Schwarzer, M. Saha, and J.-C. Latombe, “Exact Collision Checking of Robot Paths,”
Proc. Fourth Workshop Algorithmic Foundations of Robotics (WAFR '02), Dec. 2002. |