Collision Detection in Interactive 3D Environments

Collision Detection in Interactive 3D Environments

Volumn , Issue , 2003, Pages 1-285

  van den Bergen, Gino ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85121258281     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781482297997     Document Type: Book

References (138)

1. J. Amanatides and K. Choi. Ray tracing triangular meshes. In Proc. 8th Western Computer Graphics Symposium, pages 43-52, 1997.
2. J. Amanatides and A. Woo. A fast voxel traversal algorithm for ray tracing. In Proc. Eurographics '87, pages 3-10, 1987.
3. C. Bajaj and T. K. Dey. Convex decomposition of polyhedra and robustness. SIAM Journal on Computing, 21:339-364, 1992.
4. D. Baraff. Analytical methods for dynamic simulation of nonpenetrating rigid bodies. In Proc. SIGGRAPH '89, volume 23, pages 223-232, 1989.
5. D. Baraff. Curved surfaces and coherence for non-penetrating rigid body simulation. In Proc. SIGGRAPH '90, volume 24, pages 19-28, 1990.
6. D. Baraff. Dynamic Simulation of Noh-Penetrating Rigid Bodies. PhD thesis, Computer Science Department, Cornell University, 1992. Technical Report 92-1275.
7. C. B. Barber, D. P. Dobkin, and H. Huhdanpaa. The Quickhull algorithm for convex hull. ACM Transactions on Mathematical Software, 22:469-483, 1996.
8. C. B. Barber and H. Huhdanpaa. Home page for qhull. http://www.geom.umn.edu/software/qhull/, 1995. Software library.
9. B. G. Baumgart. A polyhedron representation for computer vision. In Proc. AFIPS National Computer Conference, volume 44, pages 589-596, 1975.
10. G. Bell, R. Carey, and C. Marrin. VRML97: The Virtual Reality Modeling Language. http://www.vrml.org/Specifications/VRML97, 1997.
11. J. F. Blinn. A trip down the graphics pipeline: Line clipping. IEEE Computer Graphics and Applications, 11(1):98-105, 1991.
12. J. W. Boyse. Interference detection among solids and surfaces. Communications of the ACM, 22:3-9, 1979.
13. S. Cameron. A study of the clash detection problem in robotics. In Proc. IEEE International Conference on Robotics and Automation, pages 488-493, 1985.
14. S. Cameron. Collision detection by four-dimensional intersection testing. IEEE Transactions on Robotics and Automation, 6(3):291-302, 1990.
15. S. Cameron. Enhancing GJK: Computing minimum and penetration distances between convex polyhedra. In Proc. IEEE International Conference on Robotics and Automation, pages 3112-3117, 1997.
16. S. A. Cameron and R. K. Culley. Determining the minimum translational distance between convex polyhedra. In Proc. IEEE International Conference on Robotics and Automation, pages 591-596, 1986.
17. J. Canny. Collision detection for moving polyhedra. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-8(2):200-209, 1986.
18. J. Carmack and M. Abrash. Quake source. http://www.idsoftware.com/business/home/techdownloads/, 1997.
19. F. Cazals and C. Puech. Bucket-like space partitioning data structures with applications to ray-tracing. In Proc. 13th Annual ACM Symposium on Computational Geometry, pages 11-20, 1997.
20. B. Chazelle. Convex partitions of polyhedra: A lower bound and worst-case optimal algorithm. SIAM Journal on Computing, 13:488-507, 1984. '
21. B. Chazelle. Decomposing the boundary of a nonconvex polyhedron. Algorithmica, 17:327-342, 1997.
22. B. Chazelle and D. P. Dobkin. Detection is easier than computation. In Proc. 12th Annual ACM Symposium on Theory of Computing, pages 146-153, 1980.
23. K. Chung and W. Wang. Quick collision detection of polytopes in virtual environments. In Proc. ACM Symposium on Virtual Reality Software and Technology, pages 125-131, 1996.
24. 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. In Proc. ACM Symposium on Interactive 3D Graphics, pages 189-196, 1995.
25. E. Coumans. 3D-DDA on a dynamic grid. Posted on the comp, graphics. algorithms newsgroup, Feb. 2003.
26. H. S. M. Coxeter. Introduction to Geometry. Wiley, New York, 2nd edition, 1989.
27. M. de Berg. Linear size binary space partitions for fat objects. In Proc. 3rd Annual European Symposium Algorithms, volume 979 of Lecture Notes in Computer Science, pages 252-263. Springer-Verlag, New York, 1995.
28. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
29. D. P. Dobkin and D. G. Kirkpatrick. Fast detection of polyhedral intersection. Theoretical Computer Science, 27:241-253, 1983.
30. D. P. Dobkin and D. G. Kirkpatrick. A linear algorithm for determining the separation of convex polyhedra. Journal of Algorithms, 6:381-392, 1985.
31. D. P. Dobkin and D. G. Kirkpatrick. Determining the separation of preprocessed polyhedra—a unified approach. In Proc. 17th International Colloquium on Automata, Languages and Programming (ICALP), volume 443 of Lecture Notes in Computer Science, pages 400-413. Springer-Verlag, New York, 1990.
32. V. J. Duvanenko, W. E. Robbins, and R. S. Gyurcsik. Improving line segment clipping. Dr. Dobb’s Journal, pages 36-45, July 1990.
33. V. J. Duvanenko, W. E. Robbins, and R. S. Gyurcsik. Line-segment clipping revisited. Dr. Dobb’s Journal, pages 107-110, Jan. 1996.
34. M. E. Dyer. Linear time algorithms for two- and three-variable linear programs. SIAM Journal on Computing, 13:31-45, 1984.
35. D. H. Eberly. 3D Game Engine Design: A Practical Approach to RealTime Computer Graphics. Morgan Kaufmann Publishers, San Francisco, 2001.
36. D. H. Eberly. Game Physics. Morgan Kaufmann Publishers, San Francisco, 2002.
37. J. Eckstein and E. Schömer. Dynamic collision detection in virtual reality applications. In Proc. 7th International Conference in Central Europe on Computer Graphics and Visualization and Interactive Digital Media, WSCG '99, pages 71-78, 1999.
38. H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, New York, 1987.
39. S. A. Ehmann. SWIFT—speedy walking via improved feature testing. http://www.cs.unc.edu/~geom/SWIFT/, 2000. Software library.
40. S. A. Ehmann and M. C. Lin. Accelerated proximity queries between convex polyhedra by multi-level Voronoi marching. In Proc. International Conference on Intelligent Robots and Systems, 2000.
41. S. A. Ehmann and M. C. Lin. Accurate and fast proximity queries between polyhedra using convex surface decomposition. In Computer Graphics Forum (Proc. EUROGRAPHICS 2001), 2001.
42. J. Fenlason and R. Stallman. GNU gprof: The GNU Profiler. Free Software Foundation, 1992.
43. J. D. Foley, A. van Dam, S. K. Feiner, and J. F. Hughes. Computer Graphics: Principles and Practice. Addison-Wesley, Reading, MA, 2nd edition, 1990.
44. B. Fomitchev. STLport. http://www.stlport.org/, 1999. Software library.
45. A. U. Frank and R. Barrera. The Fieldtree: A data structure for geographic information systems. In A. Buchmann, O. Günther, T. R. Smith, and Y.-F. Wang, editors, Proc. 1st Symposium SSD on Design and Implementation of Large Spatial Databases, volume 409 of Lecture Notes in Computing Science, pages 29-44. Springer-Verlag, New York, 1990.
46. H. Fuchs, Z. M. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. In Proc. SIGGRAPH ’80, volume 14, pages 124-133, 1980.
47. K. Y. Fung, T. M. Nicholl, R. E. Tarjan, and C. J. Van Wyk. Simplified linear-time Jordan sorting and polygon clipping. Information Processing Letters, 35:85-92, 1990.
48. M. A. Ganter and B. P. Isarankura. Dynamic collision detection using space partitioning. Journal of Mechanical Design, 115:150-155, 1993.
49. A. Garcia-Alonso, N. Serrano, and J. Flaquer. Solving the collision detection problem. IEEE Computer Graphics and Applications, 14:36-43, 1994.
50. E. G. Gilbert. An iterative procedure for computing the minimum of a quadratic form on a convex set. SIAM Journal on Control, 4:61-80, 1966.
51. E. G. Gilbert and C.-P. Foo. Computing the distance between general convex objects in three-dimensional space. IEEE Transactions on Robotics and Automation, 6(1):53—61, 1990.
52. E. G. Gilbert, D. W. Johnson, and S. S. Keerthi. A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE Journal of Robotics and Automation, 4(2):193-203, 1988.
53. A. S. Glassner. An Introduction to Ray Tracing. Academic Press, Boston, 1989.
54. A. S. Glassner. Clipping a concave polygon. In A. W. Paeth, editor, Graphics Gems V, pages 50-54. Academic Press, Boston, 1995.
55. D. Goldberg. What every computer scientist should know about floating-point arithmetic. ACM Computing Surveys, 23( 1 ):5-48, 1991.
56. G. H. Golub and C. F. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, MD, 3rd edition, 1996.
57. M. Gomez. Compressed axis-aligned bounding box trees. In M. DeLoura, editor, Game Programming Gems 2, pages 388-393. Charles River Media, Hingham, MA, 2001.
58. S. Gottschalk. RAPID: Robust and accurate polygon interference detection system. http://www.cs.unc.edu/~geom/OBB/OBBT.html, 1996. Software library.
59. S. Gottschalk, M. C. Lin, and D. Manocha. OBBTree: A hierarchical structure for rapid interference detection. In Proc. SIGGRAPH '96, pages 171-180, 1996.
60. D. Green and D. Hatch. Fast polygon-cube intersection testing. In A. W. Paeth, editor, Graphics Gems V, pages 375-379. Academic Press, Boston, 1995.
61. B. Grünbaum. Convex Polytopes. Wiley, New York, 1967.
62. L. J. Guibas, D. Hsu, and L. Zhang. H-walk: Hierarchical distance computation for moving convex bodies. In Proc. 15th Annual ACM Symposium on Computational Geometry, pages 265-273, 1999.
63. J. K. Hahn. Realistic animation of rigid bodies. In Proc. SIGGRAPH ’88, volume 22, pages 299-308, 1988.
64. E. Haines. Point in polygon strategies. In P. Heckbert, editor, Graphics Gems IV, pages 24-46. Academic Press, Boston, 1994.
65. Havok. Havok game dynamics sdk. http://www.havok.com/, 2000. Software library.
66. M. Held. ERIT—A collection of efficient and reliable intersection tests. Journal of Graphics Tools, 2(4):25-44, 1997.
67. K. Hoffmann, K. Mehlhom, P. Rosenstiehl, and R. E. Tarjan. Sorting Jordan sequences in linear time using level-linked search trees. Information and Control, 68:170-184, 1986.
68. M. Hohmeyer. LP, a C implementation of Seidel’s randomized linear programming algorithm, http://graphics.lcs.mit.edu/~seth/geomlib/geomlib.html, 1990. Software library.
69. J. E. Hopcroft, J. T. Schwartz, and M. Sharir. Efficient detection of intersections among spheres. International Journal of Robotics Research, 2(4):77-80, 1983.
70. H. Hoppe. Progressive meshes. In Proc. SIGGRAPH '96, pages 99-108, 1996.
71. P. M. Hubbard. Space-time bounds for collision detection. Technical Report CS-93-04, Dept, of Computer Science, Brown University, 1993.
72. P. M. Hubbard. Collision detection for interactive graphics applications. IEEE Transactions on Visualization and Computer Graphics, l(3):218-230, 1995.
73. P. M. Hubbard. Approximating polyhedra with spheres for time- critical collision detection. ACM Transactions on Graphics, 15(3): 179-210, 1996.
74. L. Kettner. Designing a data structure for polyhedral surfaces. In Proc. 14th Annual ACM Symposium on Computational Geometry, pages 146-154, 1998.
75. D.-J. Kim, L. J. Guibas, and S.-Y. Shin. Fast collision detection among multiple moving spheres. In Proc. Computer Animation ’97, pages 1-7, 1997.
76. J. T. Klosowski, M. Held, J. S. B. Mitchell, H. Sowizral, and K. Zikan. Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Transactions on Visualization and Computer Graphics, 4(l):21-36, 1998.
77. D. Knuth. The Art of Computer Programming. Addison-Wesley, Reading, MA, 1973.
78. Y.-D. Liang and B. A. Barsky. A new concept and method for line clipping. ACM Transactions on Graphics, 3:1-22, 1984.
79. M. C. Lin and J. F. Canny. A fast algorithm for incremental distance computation. In Proc. IEEE International Conference on Robotics and Automation, pages 1008-1014, 1991.
80. T. Lozano-Pérez. Spatial planning: A configuration space approach. IEEE Transactions on Computers, C-32:108-120, 1983.
81. D. G. Luenberger. Linear and Nonlinear Programming. Addison- Wesley, Reading, MA, 2nd edition, 1984.
82. MathEngine. Karma, http://www.mathengine.com/, 2001. Software library.
83. M. McLaurin. Outsourcing reality: Integrating a commercial physics engine. Game Developer Magazine, 9(8):40-46, August 2002.
84. 3 and related problems. SIAM Journal on Computing, 12:759-776, 1983.
85. K. Mehlhom. Data Structures and Algorithms 1: Sorting and Searching, volume 1 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, New York, 1984.
86. S. Melax. Dynamic plane shifting BSP traversal. In Proc. Graphics Interface, pages 213-220, May 2000.
87. S. Meyers. More Effective C++. Professional Computing Series. Addison-Wesley, Reading, MA, 1996.
88. B. Mirtich. V-Clip: Fast and robust polyhedral collision detection. ACM Transactions on Graphics, 17(3):177-208, 1997.
89. T. Möller. A fast triangle-triangle intersection test. Journal of Graphics Tools, 2(2):25-30, 1997.
90. T. Möller and B. Trumbore. Fast, minimum storage ray-triangle intersection. Journal of Graphics Tools, 2( 1 ): 21—28, 1997.
91. M. Moore and J. Willhelms. Collision detection and response for computer animation. In Proc. SIGGRAPH '88, volume 22, pages 289-298, 1988.
92. D. E. Muller and F. P. Preparata. Finding the intersection of two convex polyhedra. Theoretical Computer Science, 7:217-236, 1978.
93. D. R. Musser and A. Saini. STL Tutorial and Reference Guide. Professional Computing Series. Addison-Wesley, Reading MA, 1996.
94. A. Narkhede and D. Manocha. Fast polygon triangulation based on Seidel’s algorithm. In A. W. Paeth, editor, Graphics Gems V, pages 394-397. Academic Press, Boston, 1995.
95. B. F. Naylor. Interactive solid geometry via partitioning trees. In Proc. Graphics Interface ’92, pages 11-18, 1992.
96. B. Naylor. Constructing good partitioning trees. In Proc. Graphics Interface ’93, pages 181-191, 1993.
97. B. Naylor, J. A. Amanatides, and W. Thibault. Merging BSP trees yields polyhedral set operations. In Proc. SIGGRAPH ’90, volume 24, pages 115-124, 1990.
98. C. J. Ong and E. G. Gilbert. The Gilbert-Johnson-Keerthi distance algorithm: A fast version for incremental motions. In Proc. IEEE International Conference on Robotics and Automation, pages 1183-1189, 1997.
99. C. J. Ong and E. G. Gilbert. Fast versions of the Gilbert-Johnson- Keerthi distance algorithm: Additional results and comparisions. IEEE Transactions on Robotics and Automation, 17(4): 531-539, 2001.
100. J. O’Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, New York, 1987.
101. J. O’Rourke. Computational Geometry in C. Cambridge University Press, New York, 2nd edition, 1998.
102. I. J. Palmer and R. L. Grimsdale. Collision detection for animation using sphere-trees. Computer Graphics Forum, 14(2): 105—116, 1995.
103. M. S. Paterson and F. F. Yao. Efficient binary space partitions for hidden-surface removal and solid modeling. Discrete and Computational Geometry, 5:485-503, 1990.
104. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
105. S. Redon, A. Kheddar, and S. Coquillart. Fast continuous collision detection between rigid bodies. In Proc. EUROGRAPHICS 2002, 2002.
106. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.
107. P. J. Schneider and D. H. Eberly. Geometric Tools for Computer Graphics. Morgan Kaufmann Publishers, San Francisco, 2002.
108. E. Schömer and C. Thiel. Efficient collision detection for moving polyhedra. In Proc. 11th Annual ACM Symposium on Computational Geometry, pages 51-60, 1995.
109. R. Sedgewick. Algorithms. Addison-Wesley, Reading, MA, 2nd edition, 1988.
110. R. Segura and F. Feito. Algorithms to test ray-triangle intersection: Comparative study. In Proc. WSCG'01, 2001.
111. R. Seidel. Small-dimensional linear programming and convex hulls made easy. Discrete and Computational Geometry, 6:423-434, 1991.
112. K. Shoemake. Animating rotations with quaternion curves. In Proc. SIGGRAPH ’85, volume 19, pages 245-254, July 1985.
113. K. Shoemake. Uniform random rotations. In D. Kirk, editor, Graphics Gems III, pages 124-132. Academic Press, Boston, 1992.
114. H. W. Six and D. Wood. Counting and reporting intersections of d-ranges. IEEE Transactions on Computers, C-31:181-187, 1982.
115. A. Smith, Y. Kitamura, H. Takemura, and F. Kishino. A simple and efficient method for accurate collision detection among deformable polyhedral objects in arbitrary motion. In Proc. IEEE Virtual Reality Annual International Symposium, pages 136-145, 1995.
116. R. Smith. Open dynamics engine, http://opende.sourceforge.net/, 2001. Software library.
117. J. M. Snyder. Interval analysis for computer graphics. In Proc. SIGGRAPH ’92, volume 26, pages 121-130, 1992.
118. J. Stolfi. Oriented Projective Geometry: A Framework for Geometric Computations. Academic Press, New York, 1991.
119. D. Stoyan, W. S. Kendall, and J. Mecke. Stochastic Geometry and Its Applications. Wiley, Chichester, UK, 1987.
120. B. Stroustrup. The C++ Programming Language. Addison-Wesley, Reading, MA, 3rd edition, 1997.
121. I. E. Sutherland and G. W. Hodgman. Reentrant polygon clipping. Communications of the ACM, 17:32-42, 1974.
122. I. E. Sutherland, R. F. Sproull, and R. A. Schumacker. A characterization of ten hidden-surface algorithms. ACM Computing Surveys, 6(l):l-55, 1974.
123. F. Tampieri. Newell’s method for computing the plane equation of a polygon. In D. Kirk, editor, Graphics Gems III, pages 231-232. Academic Press, Boston, 1992.
124. P. Terdiman. Memory-optimized bounding-volume hierarchies. http://codercomer.com/CodeArticles.htm, Mar. 2001.
125. W. C. Thibault and B. F. Naylor. Set operations on polyhedra using binary space partitioning trees. In Proc. SIGGRAPH '87, volume 21, pages 153-162, 1987.
126. F. Thomas and C. Torras. Interference detection between non-convex polyhedra revisited with a practical aim. In Proc. IEEE International Conference on Robotics and Automation, pages 587-594, 1994.
127. G. van den Bergen. Efficient collision detection of complex deformable models using AABB trees. Journal of Graphics Tools, 2(4): 1-14, 1997.
128. G. van den Bergen. A fast and robust GJK implementation for collision detection of convex objects. Journal of Graphics Tools, 4(2):7-25, 1999.
129. D. Voorhies. Triangle-cube intersection. In D. Kirk, editor, Graphics Gems III, pages 236-239. Academic Press, Boston, 1992.
130. R. Webb and M. Gigante. Using dynamic bounding volume hierarchies to improve efficiency of rigid body simulations. In T. L. Kunii, editor, Visual Computing (Proc. CG International ’92), pages 825-842. Springer-Verlag, New York, 1992.
131. H. Weghorst, G. Hooper, and D. P. Greenberg. Improved computational methods for ray tracing. ACM Transactions on Graphics, 3(l):52-69, 1994.
132. E. Welzl. Smallest enclosing disks (balls and ellipsoids). In H. Maurer, editor, New Results and New Trends in Computer Science, volume 555 of Lecture Notes in Computer Science, pages 359-370. Springer-Verlag, New York, 1991.
133. M. Woo, J. Neider, and T. Davis. OpenGL Programming Guide. Addison-Wesley, Reading, MA, 2nd edition, 1997.
134. X. Wu. A linear-time simple bounding volume algorithm. In D. Kirk, editor, Graphics Gems III, pages 301-306. Academic Press, Boston, 1992.
135. G. Zachmann. Rapid collision detection by dynamically aligned DOP-trees. In Proc. IEEE Virtual Reality Annual International Symposium, pages 90-97, 1998.
136. G. Zachmann. Virtual Reality in Assembly Simulation: Collision Detection, Simulation Algorithms, and Interaction Techniques. PhD thesis, Dept, of Computer Science, TU Darmstadt, 2000.
137. G. Zachmann and W. Felger. The BoxTree: Enabling real-time and exact collision detection of arbitrary polyhedra. In Proc. Workshop on Simulation and Interaction in Virtual Environments, pages 104-113, 1995.
138. M. J. Zyda, D. R. Pratt, W. D. Osborne, and J. G. Monahan. NPSNET: Real-time collision detection and response. Journal of Visualization and Computer Animation, 4(1): 13—24, 1993.