Incremental algorithms for collision detection between polygonal models

IEEE Transactions on Visualization and Computer Graphics

Volumn 3, Issue 1, 1997, Pages 51-64

  Ponamgi, Madhav K ^a   Manocha, Dinesh ^a   Lin, Ming C ^a  

^a Brooks Computer Science Building   (United States)

Author keywords

Collision detection; Contacts; Convex hulls; Dynamic simulation; Hierarchical representation; Interference; Physically based modeling

Indexed keywords

ALGORITHMS; ANIMATION; COMPUTER SIMULATION; HIERARCHICAL SYSTEMS; IMAGE PROCESSING; MATHEMATICAL MODELS; OBJECT RECOGNITION; ROBOTICS; VISUALIZATION;

COLLISION DETECTION ALGORITHMS; CONVEX HULLS;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 0030642484     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/2945.582346     Document Type: Article

References (43)

1. J.E. Hopcroft, Electronic Prototyping, IEEE Trans. Aerospace and Electronic Systems, vol. 24, no. 2, pp. 663-667, 1988.
2. C.M. Hoffmann and J.E. Hopcroft, Simulation of Physical Systems from Geometric Models, IEEE J. Robotics and Automation, vol. 3, no. 3, pp. 194-206, 1987.
3. M. Ponamgi, D. Manocha, and M. Lin, Incremental Algorithms for Collision Detection Between General Solid Models, Proc. ACM/Siggraph Symp Solid Modeling, pp. 293-304, 1995.
4. M. Held, J.T. Klosowski, and J.S.B. Mitchell, Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs, Proc. Canadian Conf. Computational Geometry, 1995.
5. G. Barequet, B. Chazelle, L. Guibas, J. Mitchell, and A. Tal, Boxtree: A Hierarchical Representation of Surfaces in 3D, Proc. Eurographics '96, 1996.
6. J. Snyder, An Interactive Tool for Placing Curved Surfaces without Interpénétration, Proc. ACM Siggraph, pp. 209-218, 1995.
7. S. Cameron and R.K. Culley, Determining the Minimum Translational Distance Between Two Convex Polyhedra, Proc. Int'l Conf. Robotics and Automation, pp. 591-596, 1986.
8. J.F. Canny, Collision Detection for Moving Polyhedra, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, pp. 200-209, 1986.
9. B. Chazelle and D.P. Dobkin, Intersection of Convex Objects in Two and Three Dimensions, J. ACM, vol. 34, pp. 1-27, 1987.
10. D.P. Dobkin and D.G. Kirkpatrick, A Linear Algorithm for Determining the Separation of Convex Polyhedra, J. Algorithms, vol. 6, pp. 381-392, 1985.
11. D. Baraff, Dynamic Simulation of Non-Penetrating Rigid Body Simulation, PhD thesis, Cornell Univ., 1992.
12. M.C. Lin and J.F. Canny, Efficient Algorithms for Incremental Distance Computation, Proc. IEEE Conf. Robotics and Automation, pp. 1, 008-1, 014, 1991.
13. M.C. Lin, Efficient Collision Detection for Animation and Robotics, PhD thesis, Dept. of Electrical Eng. and Computer Science, Univ. of California, Berkeley, Dec. 1993.
14. W. Bouma and G. Vanecek, Modeling Contacts in a Physically Based Simulation, Proc. Second Symp. Solid Modeling and Applications, pp. 409-419, 1993.
15. M. Moore and J. Wilhelms, Collision Detection and Response for Computer Animation, Computer Graphics, vol. 22, no. 4, pp. 289-298, 1988.
16. W. Bouma and G. Vanecek, Collision Detection and Analysis in a Physically Based Simulation, Proc. Eurographics Workshop Animation and Simulation, pp. 191-203, 1991.
17. S. Cameron, Approximation Hierarchies and s-Bounds, Proc. Symp. Solid Modeling Foundations and CAD/CAM Applications, pp. 129-137, Austin, Tex., 1991.
18. J. Cohen, M. Lin, D. Manocha, and M. Ponamgi, I-Collide: An Interactive and Exact Collision Detection System for Large-Scale Environments, Proc. ACM Interactive 3D Graphics Conf., pp. 189-196, 1995.
19. P. Dworkin and D. Zeltzer, A New Model for Efficient Dynamics Simulation, Proc. Eurographics Workshop Animation and Simulation, pp. 175-184, 1993.
20. A. Garcia-Alonso, N. Serrano, and J. Flaquer, Solving the Collision Detection Problem, IEEE Computer Graphics and Applications, vol. 13, no. 3, pp. 36-43, 1994.
21. B.V. Herzen, A.H. Barr, and G.R. Zatz, Geometric Collisions for Time-Dependent Parametric Surfaces, Computer Graphics, vol. 24, no. 4, pp. 39-48, 1990.
22. P.M. Hubbard, Interactive Collision Detection, Proc. IEEE Symp. Research Frontiers in Virtual Reality, Oct. 1993.
23. G. Turk, Interactive Collision Detection for Molecular Graphics, Master's thesis, Computer Science Dept., Univ. of North Carolina at Chapel Hill, 1989.
24. H. Fuchs, Z. Kedem, and B. Naylor, On Visible Surface Generation by a priori Tree Structures, Proc. ACM Siggraph, vol. 14, no. 3, pp. 124-133, 1980.
25. B. Naylor, J. Amanatides, and W. Thibault, Merging BSP Trees Yield Polyhedral Modeling Results, Proc. ACM Siggraph, pp. 115-124, 1990.
26. B. Naylor, Interactive Solid Geometry via Partitioning Trees, Proc. Graphics Interface, pp. 11-18, 1992.
27. S. Gottschalk, M. Lin, and D. Manocha, Obb-Tree: A Hierarchical Structure for Rapid Interference Detection, Proc. ACM Siggraph '96, pp. 171-180, 1996.
28. T. Duff, Interval Arithmetic and Recursive Subdivision for Implicit Functions and Constructive Solid Geometry, ACM Computer Graphics, vol. 26, no. 2, pp. 131-139, 1992.
29. J. Snyder et al., Interval Methods for Multi-Point Collisions Between Time Dependent Curved Surfaces, Proc. ACM Siggraph, pp. 321-334, 1993.
30. M.C. Lin and D. Manocha, Efficient Contact Determination Between Time Dependent Curved Surfaces, Int'l J. Computational Geometry and Applications, to appear.
31. E.G. Gilbert and C.J. Ong, New Distances for the Separation and Penetration of Objects, Proc. Int'l Conf. Robotics and Automation, pp. 579-586, 1994.
32. P.P. Preparata and M.I. Shamos, Computational Geometry. New York: Springer-Verlag, 1985.
33. B. Chazelle, Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm, SIAM }. Computing, vol. 13, pp. 488-507, 1984.
34. C.L. Bajaj and T. Dey, Convex Decomposition of Polyhedra and Robustness, SIAM J. Computing, vol. 21, pp. 339-364, 1992.
35. P. Loutrel, Determination of Hidden Edges in Polyhedral Figures, Technical Report NYU3-12-1966, Dept. of Computer Science, New York Univ., 1966.
36. A. Appel and P. Will, Determining the Three-Dimensional Convex Hull of a Polyhedron, IBM J. Research and Development, pp. 590-600, 1976.
37. B. Chazelle, An Optimal Algorithm for Intersecting ThreeDimensional Convex Polyhedra, Proc. 30th Ann. IEEE Symp. Foundations of Computer Science, pp. 586-591, 1989.
38. D. Muller and F. Preparata, Finding the Intersection of Two Convex Polyhedra, Theoretical Computer Science, vol. 8, no. 2, pp. 217-236, 1978.
39. B. Barber, D. Dobkin, and H. Huhdanpaa, The Quickhull Algorithm for Convex Hull, Technical Report GCG53, the Geometry Center, Minn., 1993.
40. J. O'Rourke, Computational Geometry in C. Cambridge Univ. Press, 1994.
41. J.L. Nevins and D.E. Whitney, Assembly Research, Factory Automation, vol. 2, Maidenhead, England, 1980.
42. E. Nicolson and R. Fearing, Dynamic Simulation of a PartMating Problem: Threaded Fastener Insertion, Proc. IEEE/RS] Int'l Conf. Intelligent Robots and Systems, pp. 30-37, 1991.
43. E. Nicolson, personal communication, 1994.