A Linear Programming Solution for Exact Collision Detection

[+] Author and Article Information
Ali Akgunduz

Concordia University, Department of Mechanical and Industrial Engineering, 1455 de Maisonneuve Blvd. West, Montreal, Quebec H3G 1M8 phone (514) 848-2424 (Ext. 3179)e-mail: akgunduz@me.concordia.ca

Prashant Banerjee

University of Illinois at Chicago, Department of Mechanical and Industrial Engineering, 2039 ERF, 842 W. Taylor St., Chicago, IL 60607-7022 phone: (312) 996 5599e-mail: banerjee@uic.edu

Sanjay Mehrotra

Northwestern University, Industrial Engineering and Management Science, 2145 Sheridan Road, Tech C210, Evanston, IL 60208 phone: (847) 491-3155e-mail: mehrotra@iems.nwu.edu

J. Comput. Inf. Sci. Eng 5(1), 48-55 (Mar 14, 2005) (8 pages) doi:10.1115/1.1846053 History: Received May 21, 2004; Revised October 07, 2004; Online March 14, 2005
Copyright © 2005 by ASME
Your Session has timed out. Please sign back in to continue.


Baraff, D., 1992, “Dynamic Simulation of Non-Penetrating Rigid Bodies,” Ph.D. thesis, Department of Computer Science, Cornell University, Ithaca, NY.
Ponamgi, M., Manocha, D., and Lin, M. C., 1995, “Incremental Algorithms for Collision Detection Between Solid Models,” in Proc. ACM/SIGGRAPH Symp. on Solid Modeling, pp. 293–304.
Ponamgi,  M., Manocha,  D., and Lin,  M., 1997, “Incremental Algorithms for Collision Detection Between Solid Models,” IEEE Trans. Vis. Comput. Graph., 3(1), pp. 51–64.
Samet, S., 1989, Spatial Data Structures: Quadtree, Octree and Other Hierarchical Methods, Addison Wesley, Reading, MA.
Hudson, T., Lin, M., Cohen, J., Gottschalk, S., and Manocha, D., 1997, “V-COLLIDE: Accelerated Collision Detection for VRML,” in Proc. of VRML’97.
Quinlan, S., 1994, “Efficient Distance Computation Between Non-Convex Objects,” in Proc. IEEE Conf. on Robotics and Automation, pp. 3324–3329.
Gottschalk, S., Lin, M., and Manocha, D., 1996, “OBB-Tree: A Hierarchical Structure for Rapid Interference Detection,” in Proceedings of ACM SIGGRAPH.
Hubbard,  P. M., 1995, “Collision Detection for Interactive Graphics Applications,” IEEE Trans. Vis. Comput. Graph., 1(3), pp. 218–230.
Cameron, S., 1991, “Approximation Hierarchies and S-Bounds,” in Proc. Symposium on Solid Modeling Foundations and CAD/CAM Applications, Austin, TX, pp. 129–137.
Klosowski,  J. T., Held,  M., Mitchell,  J. S. B., Sowizral,  H., and Zikan,  K., 1998, “Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs,” IEEE Trans. Vis. Comput. Graph., 4(1), pp. 21–36.
Cohen, J. D., Lin, M. C., Manocha, D., and Ponamgi, M., 1995, “I-COLLIDE: An Interactive and Exact Collision Detection System for Large Scale Environments,” in Proc. ACM Int. 3D Graphics Conference, pp. 189–196.
Lin, M. C., and Canny, J. F., 1991, “A Fast Algorithm for Incremental Distance Calculation,” in Proc IEEE Conf. on Robotics and Automation, Vol. 2, pp. 1008–1014.
Gilbert,  E. G., Johnson,  D. W., and Keerthi,  S. S., 1988, “A Fast Procedure for Computing the Distance Between Complex Objects in Three-Dimensional Space,” IEEE Trans. Rob. Autom., 4(2), pp. 193–203.
Tan, T. S., Chong, K. F., and Low, K. L., 1999, “Computing Bounding Volume Hierarchies Using Model Simplification,” in Proc. ACM Symposium On Interactive 3D Graphics, pp. 63–70.
Ong, C. J., and Gilbert, E. G., 1997, “The Gilbert-Johnson-Keerthi Distance Algorithm: A Fast Version for Incremental Motions,” in Proc. IEEE Conf. on Robotics and Automation, pp. 1183–1189.
Ong, C. J., and Gilbert, E. G., 1999, “The Gilbert-Johnson-Keerthi Distance Algorithm: A Fast Version for Incremental Motions,” Technical Report, Univ. of Michigan, Ann Arbor.
Mirtich,  B., 1998, “V-Clip: Fast and Robust Polyhedral Collision Detection,” ACM Trans. Graphics, 17(3), pp. 177–208.
Cameron, S., 1997, “Enhancing GJK: Computing Minimum and Penetration Distance Between Convex Polyhedra,” in Proc. IEEE Conf. on Robotics and Automation, pp. 3112–3117.
van den Bergen,  G., 1999, “A Fast and Robust GJK Implementation for Collision Detection of Convex Objects,” J. Graphics Tools,4(2), pp. 7–25.
van den Bergen,  G., 1999, “Efficient Collision Detection of Complex Deformable Models Using AABB Trees,” J. Graphics Tools,2(4), pp. 1–14.
Ehmann, S. A., and Lin, M. C., 2001, “Accurate and Fast Proximity Queries Between Polyhedra Using Surface Decomposition,” in Eurographics. Computer Graphics Forum, Vol. 20(3).
Luciano, C., Banerjee, P., DeFanti, T., and Mehrotra, S., 2003, “A Framework for Efficient and More Realistic Haptics Applications,” in Proceedings of 23rd ASME Computers and Information in Engineering Conference, Chicago.
Xavier, P. G., 1997, “Fast Swept-Volume Distance for Robust Collision Detection,” in Proc. IEEE International Conference on Robotics and Automation, Albuquerque, NM.
Redon, S., Kheddar, A., and Coquillart, S., 2002, “Fast Continues Collision Detection Between Rigid Bodies,” Eurographics, Vol. 21(3).
Megiddo,  N., 1983, “Linear-Time Algorithms for Linear Programming in R3 and Related Problems,” SIAM J. Comput., 12(4), pp. 759–776.
Seidel, R., 1990, “Linear Programming and Convex Hulls Made Easy,” in Proc. 6th Ann. ACM Conf. on Computational Geometry, pp. 211–215, Berkeley, CA.
Foley, J., van Dam, A., Feiner, S., and Hughes, J., 1993, Computer Graphics, 2nd ed., 5th printing, Addison Wesley, Reading, MA.
Gallerini,  R., and Sciomachen,  A., 1993, “On Using LP to Collision Detection Between a Manipulator Arm and Surrounding Obstacles,” Eur. J. Oper. Res., 63, pp. 343–350.
Mehrotra,  S., 1992, “On the Implementation of a Primal-Dual Interior Point Method,” SIAM J. Optim., 2(4), pp. 575–601.
Ye, Y., 1997, Interior Point Algorithms: Theory and Analysis, John Wiley, New York.
Megiddo,  N., 1984, “Linear Programming in Linear Time When the Dimension is Fixed,” J. Assoc. Comput. Mach., 31(1), pp. 114–127.
Golub, G. H., and van Loan, C. F., 1996, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore.


Grahic Jump Location
Collision is missed due to large time steps
Grahic Jump Location
Early collision determination using virtual plane
Grahic Jump Location
Extended object assuming geometric coherence of frames
Grahic Jump Location
Partially extended object assuming geometric coherence of frames. Only vertices {a, b, c, and d} are extended.
Grahic Jump Location
Bounding box-vertex mapping for interframe collision detection
Grahic Jump Location
Selection of bounding-box vertices closer to the direction of object movement
Grahic Jump Location
Picture of the ten different randomly chosen objects
Grahic Jump Location
Pairwise performance comparison just before the collision
Grahic Jump Location
Performance comparison when number of objects is increased
Grahic Jump Location
Ten different objects under varying object densities determined by different sizes of the enclosing cubical space
Grahic Jump Location
Performance comparison when translational speed is increased
Grahic Jump Location
Performance comparison when rotational speed is increased



Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In