Kinetic sweep and prune for multi-body continuous motion

Computers and Graphics (Pergamon)

Volumn 30, Issue 3, 2006, Pages 439-449

  Coming, Daniel S ^a   Staadt, Oliver G ^a  

^a University of California Davis   (United States)

Author keywords

Dynamic collision detection; Kinetic data structures; Methodology and techniques graphics data structures and data types; Three dimensional graphics and realism virtual reality

Indexed keywords

COLLISION AVOIDANCE; DATA STRUCTURES; KINETIC THEORY; REAL TIME SYSTEMS; THREE DIMENSIONAL COMPUTER GRAPHICS; VIRTUAL REALITY;

DYNAMIC COLLISION DETECTION; KINETIC DATA STRUCTURES; METHODOLOGY AND TECHNIQUES-GRAPHICS DATA STRUCTURES AND DATA TYPES; THREE-DIMENSIONAL GRAPHICS AND REALISM-VIRTUAL REALITY;

MOTION ESTIMATION;

EID: 33646775324     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cag.2006.02.014     Document Type: Article

References (42)

1. Held M, Klosowski JT, Mitchell JSB. Evaluation of collision detection methods for virtual reality fly-throughs. In: Proceedings of the seventh Canadian conference on computational geometry, 1995. p. 205-10.
2. Coming DS, Staadt OG, Velocity-aligned discrete oriented polytopes for dynamic collision detection. Technical Report CSE-2004-25, Department of Computer Science, UC Davis, September 2004.
3. Cohen JD, Lin MC, Manocha D, Ponamgi MK. I-COLLIDE: an interactive and exact collision detection system for large-scale environments. In: Symposium on interactive 3D graphics, 1995. p. 189-96 and 218.
4. Zachmann G. Minimal hierarchical collision detection. In: Proceedings of the ACM symposium on virtual reality software and technology. New York: ACM Press; 2002. p. 121-8.
5. Eckstein J, Schömer E. Dynamic collision detection in virtual reality applications. In: Proceedings of the seventh international conference in central Europe on computer graphics, visualization, and interactive digital media '99 (WSCG'99), Plzen, Czech Republic; 1999. p. 71-8.
6. Fünfzig C, Fellner DW. Easy realignment of k-DOP bounding volumes. In: Proceedings of the graphics interface '03. Norwick, MA: A.K. Peters, Ltd.; 2003. p. 257-64.
7. Zachmann G. Rapid collision detection by dynamically aligned DOP-trees. In: Proceedings of the virtual reality annual international symposium. Silver Spring, MD: IEEE Computer Society; 1998. p. 90-7.
8. Kim D.-J., Guibas L.J., and Shin S.Y. Fast collision detection among multiple moving spheres. IEEE Transactions on Visualization and Computer Graphics 4 3 (1998) 230-242
9. Hubbard P.M. Collision detection for interactive graphics applications. IEEE Transactions on Visualization and Computer Graphics 1 3 (1995) 218-230
10. Hubbard P.M. Approximating polyhedra with spheres for time-critical collision detection. ACM Transactions on Graphics 15 3 (1996) 179-210
11. Palmer I., and Grimsdale R.L. Collision detection for animation using sphere-trees. Computer Graphics Forum 14 2 (1995) 105-116
12. O'Sullivan C, Dingliana J. Real-time collision detection and response using sphere trees. In: Proceedings of the 15th spring conference on computer graphics '99, 1999. p. 83-92.
13. Redon S, Kheddar A, Coquillart S. CONTACT: arbitrary in-between motions for collision detection. In: Proceedings of IEEE workshop on robot-human interaction, ROMAN, 2001. p. 106-11.
14. Eberly D. Dynamic collision detection using oriented bounding boxes. Geometric Tools, Inc. (2002). URL 〈citeseer.ist.psu.edu/486021.html 〉.
15. Redon S., Kheddar A., and Coquillart S. Fast continuous collision detection between rigid bodies. Computer Graphics Forum 21 3 (2002) 279
16. Redon S, Kim YJ, Lin MC, Manocha D. Fast continuous collision detection for articulated models. Journal of Computing and Information Sciences in Engineering 2005;5(2):126-37.
17. Gottschalk S, Lin MC, Manocha D. OBBTree: a hierarchical structure for rapid interference detection. In: Proceedings of the 23rd annual conference on computer graphics and interactive techniques. New York: ACM Press; 1996. p. 171-80.
18. Gottschalk SA. Collision queries using oriented bounding boxes. PhD thesis, UNC Chapel Hill; 2000.
19. de Berg M, Comba J, Guibas LJ. A segment-tree based kinetic bsp. In: SCG '01: Proceedings of the seventeenth annual symposium on computational geometry. New York: ACM Press; 2001. p. 134-40.
20. Klosowski J.T., Held M., Mitchell J.S.B., Sowizral H., and Zikan K. Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Transactions on Visualization and Computer Graphics 4 1 (1998) 21-36
21. van den Bergen G. Efficient collision detection of complex deformable models using AABB trees. Journal of Graphics Tools 2 4 (1997) 1-13
22. van den Bergen G. Continuous collision detection of general objects under translation. In: Lecture notes, game developers conference, 2005.
23. Larsson T, Akenine-Möller T. Collision detection for continuously deforming bodies. In: Eurographics 2001, 2001. p. 325-33, short presentation.
24. Zachmann G. Optimizing the collision detection pipeline. In: Proceedings of the first international game technology conference (GTEC'01), Hong Kong, China; 2001.
25. Mirtich B, Canny JF. Impulse-based simulation of rigid bodies. In: Proceedings of the 1995 symposium on interactive 3D graphics. New York: ACM Press; 1995. 181-8.
26. Lennerz C, Schömer E, Warken T. A framework for collision detection and response. In: 11th European simulation symposium, ESS'99, 1999. p. 309-14.
27. Hotz G, Kerzmann A, Lennerz C, Schmid R, Schömer E, Warken T. SiLVIA-a simulation library for virtual reality applications. In: Proceedings of IEEE virtual reality, 1999. p. 82.
28. van den Bergen G. A fast and robust GJK implementation for collision detection of convex objects. Journal of Graphics Tools 4 2 (1999) 7-25
29. van den Bergen G. Proximity queries and penetration depth computation on 3D game objects. In: Game developers conference, 2001.
30. Ehmann S.A., and Lin M.C. Accurate and fast proximity queries between polyhedra using surface decomposition. Computer Graphics Forum 20 3 (2001) 500-510
31. Hudson TC, Lin MC, Cohen JD, Gottschalk SA, Manocha D. V-COLLIDE: accelerated collision detection for VRML. In: Carey R, Strauss P, editors, VRML 97: second symposium on the virtual reality modeling language, vol. C24-26. New York: ACM Press; 1997. p. 119-25.
32. Lin M, Canny JF. Efficient algorithms for incremental distance computation. In: Proceedings of the IEEE conference on robotics and automation, 1991. p. 1008-14.
33. Cameron S. Collision detection by four-dimensional intersection testing. IEEE Transactions on Robotics and Automation 6 3 (1990) 291-302
34. Basch J., Guibas L.J., and Hershberger J. Data structures for mobile data. Journal of Algorithms 31 1 (1999) 1-28
35. Basch J., Erickson J., Guibas L.J., Hershberger J., and Zhang L. Kinetic collision detection between two simple polygons. Computational Geometry Theory and Applications 27 3 (2004) 211-235
36. Coming DS, Staadt OG. Kinetic sweep and prune for collision detection. In: Second workshop in virtual reality interactions and physical simulations, 2005. p. 81-90.
37. Press W.H., Teukolsky S.A., Vetterling W.T., and Flannery B.P. Numerical recipes in C: the art of scientific computing (1992), Cambridge University Press, New York, NY, USA p. 183-5
38. Abam MA, de Berg M. Kinetic sorting and kinetic convex hulls. In: SCG '05: Proceedings of the twenty-first annual symposium on computational geometry, Pisa, Italy, New York: ACM Press; 2005. p. 190-7.
39. Mirtich B. Timewarp rigid body simulation. In: SIGGRAPH '00: Proceedings of the 27th annual conference on computer graphics and interactive techniques. New York/Reading, MA: ACM Press/Addison-Wesley Publishing Co.; 2000. p. 193-200.
40. Kim B, Rossignac J. Collision prediction for polyhedra under screw motions. In: SM '03: Proceedings of the eighth ACM symposium on solid modeling and applications. New York: ACM Press; 2003, p. 4-10.
41. Eberly D. Intersection of objects with linear and angular velocities using oriented bounding boxes, Geometric Tools, Inc. (1999). URL 〈http://geometrictools.com/Documentation.html 〉.
42. Stasko J.T., and Vitter J.S. Pairing heaps: experiments and analysis. Communications of the ACM 30 3 (1987) 234-249