The Visual Computer

, Volume 11, Issue 10, pp 542–561 | Cite as

Fast interference detection between geometric models

  • Ming C. Lin
  • Dinesh Manocha
Orginal Articles


We present efficient algorithms for interference detection between geometric models described by linear or curved boundaries and undergoing rigid motion. The set of models include surfaces described by rational spline patches or piecewise algebraic functions. In contrast to previous approaches, we first describe an efficient algorithm for interference detection between convex polytopes using coherence and local features. Then an extension using hierarchical representation to concave polytopes is presented. We apply these algorithms along with properties of input models, local and global algebraic methods for solving polynomial equations, and the geometric formulation of the problem to devise efficient algorithms for convex and nonconvex curved objects. Finally, a scheduling scheme to reduce the frequency of interference detection in large environments is described. These algorithms have been successfully implemented and we discuss their performance in various environments.

Key words

Interference Coherence Spline models Simulations Animation Synthetic environments 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Baraff D (1990) Curved surfaces and coherence for non-penetrating rigid body simulation. ACM Computer Graphics. 24(4):19–28CrossRefGoogle Scholar
  2. Barzel R, Barr A (1988) A modeling system based on dynamic constraints. ACM Computer Graphics 22(4):31–39CrossRefGoogle Scholar
  3. Boyse JW (1979) Interference detection among solids and surfaces. Comm ACM 22(1):3–9CrossRefGoogle Scholar
  4. Canny JF (1986) Collision detection for moving polyhedra. IEEE Trans PAMI 8:200–209Google Scholar
  5. Cameron S, Culley RK (1986) Determining the minimum translational distance between two convex polyhedra. In: Proceedings of International Conference on Robotics and Automation, pp 591–596Google Scholar
  6. Dahmen W, Michelli C (1983) Recent progress in multivariate splines. In: Approximation Theory IV. Academic, New York, pp 27–121Google Scholar
  7. Donald BR (1984) Motion planning with six degrees of freedom. Master's thesis, MIT Artificial Intelligence Lab., AI-TR-791Google Scholar
  8. Duff T (1992) Interval arithmetic and recursive subdivision for implicit functions and constructive solid geometry. ACM Computer Graphics 26(2):131–139MathSciNetCrossRefGoogle Scholar
  9. Farin G (1993) Curves and surfaces for computer aided geometric design: a practical guide. Academic, New YorkGoogle Scholar
  10. Filip D, Magedson R, Markot R (1986) Surface algorithms using bounds on derivatives. CAGD 3:295–311MATHMathSciNetGoogle Scholar
  11. Gilbert EG, Johnson DW, Keerthi SS (1988) A fast procedure for computing the distance between objects in three-dimensional space. IEEE J. Robitics and Automation RA-4: 193–203CrossRefGoogle Scholar
  12. Hahn JK (1988) Realistic animation of rigid bodies. Computer Graphics 22(4):299–308Google Scholar
  13. Herzen BV, Barr AH, Zatz HR (1990) Geometric collisions for time-dependent parametric surfaces. Computer Graphics 24(4):39–48Google Scholar
  14. Hoffmann CM (1989) Geometric and solid modeling. Kaufmann, San MateoGoogle Scholar
  15. Hall M, Warren J (1990) Adaptive polygonalization of implicitly defined surfaces. IEEE Computer Graphics and Applications, 10(6):33–42, November 1990.CrossRefGoogle Scholar
  16. Latombe JC (1994) Robot motion planning. Kluwer, London New YorkGoogle Scholar
  17. Lin MC, Canny JF (1991) Efficient algorithms for incremental distance computation. In: IEEE Conference on Robotics and AutomationGoogle Scholar
  18. Lin MC (1993) Efficient collision detection for animation and robotics. PhD thesis, Department of Electrical Engineering and Computer Science, University of California, BerkeleyGoogle Scholar
  19. Lin MC, Manocha D (1994) Efficient contact determination between geometric models. Technical Report TR94-024, Department of Computer Science, University of North Carolina, Chapel HillGoogle Scholar
  20. Lozano-Pérez T, Wesley M (1979) An algorithm for planning collision-free paths among polyhedral obstacles. Comm ACM 22(10):560–570CrossRefGoogle Scholar
  21. Manocha D (1992) Algebraic and numeric techniques for modeling and robotics. PhD thesis, Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, BerkeleyGoogle Scholar
  22. Manocha D (1994) Solving systems of polynomial equations. IEEE Computer Graphics and Applications [Suppl]:46–55Google Scholar
  23. Megiddo N (1983) Linear-time algorithms for linear programming inr 3 and related problems. SIAM J. Computing 12:759–776MATHMathSciNetCrossRefGoogle Scholar
  24. Morgan AP (1992) Pooynomial continuation and its relationship to the symbolic reduction of polynomial systems. In: Symbolic and numerical computation for artificial intelligence, pp 23–45Google Scholar
  25. Moore M, Wilhelms J (1988) Collision detection and response for computer animation. Computer Graphics 22(4): 289–298Google Scholar
  26. Pentland A (1990) Computational complexity versus simulated environment. Computer Graphics 22(2):185–192Google Scholar
  27. Preparata FP, Shamos MI (1985) Computational geometry. Springer, Berlin Heidel New YorkGoogle Scholar
  28. Pentland A, Williams J (1990) Good vibrations: modal dynamics for graphics and animation. Computer Graphics 23(3): 185–192Google Scholar
  29. Seidel R (1990) Linear programming and convex hulls made easy. In: Proceedings of the 6th Annual ACM Conference on Computational Geometry. Berkeley, pp 211–215Google Scholar
  30. Snyder J, et al (1993) Interval methods for multi-point collisions between time dependent curved surfaces. In: Proceedings of ACM Siggraph, pp 321–334Google Scholar
  31. Sturman D (1987) A discussion on the development of motion control systems. In: SigGraph course notes: computer animation: 3-D motion specification and control, no 10Google Scholar
  32. Turk G (1989) Interactive collision detection for molecular graphics. Master's thesis, Computer Science Department, University of North Carolina, Chapel HillGoogle Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Ming C. Lin
    • 1
  • Dinesh Manocha
    • 2
  1. 1.US Army Research Office Mathematical and Computer Sciences DivisionRTP
  2. 2.Computer Science DepartmentUniversity of North CarolinaChapel HillUSA

Personalised recommendations