PolyDepth: Real-time penetration depth computation using iterative contact-space projection

ACM Transactions on Graphics

Volumn 31, Issue 1, 2012, Pages

  Je, Changsoo ^a,b   Tang, Min ^a   Lee, Youngeun ^a   Lee, Minkyoung ^a   Kim, Young J ^a  

^a Ewha Womans University   (South Korea)

^b Sogang University   (South Korea)

Author keywords

Animation; Collision detection; Dynamics; Penetration depth; Polygon soups

Indexed keywords

COLLISION DETECTION; CONFIGURATION SPACE; CONTINUOUS COLLISION DETECTION; CONVEX CONE; GAUSS-SEIDEL; INTERACTIVE RATES; LINEAR COMPLEMENTARITY PROBLEMS; LOCAL OPTIMIZATIONS; POLYGON-SOUPS; POLYGONAL MODELS; RANDOM CONFIGURATIONS; REAL TIME ALGORITHMS; REAL-TIME PENETRATION; SAMPLING-BASED;

ANIMATION; COLLISION AVOIDANCE; CONES; DYNAMICS; OPTIMIZATION; PENETRATION DEPTH (SUPERCONDUCTIVITY);

ALGORITHMS;

EID: 84863289955     PISSN: 07300301     EISSN: 15577368     Source Type: Journal    
DOI: 10.1145/2077341.2077346     Document Type: Article

References (43)

1. AGARWAL, P.K.,GUIBAS, L. J.,HAR-PELED, S.,RABINOVITCH, A., AND SHARIR, M. 2000. Penetration depth of two convex polytopes in 3D. Nord. J. Comput. 7, 227-240.
2. ALLARD, J., FAURE, F.,COURTECUISSE, H., FALIPOU, F.,DURIEZ, C., AND KRY, P. G. 2010. Volume contact constraints at arbitrary resolution. ACM Trans. Graph. 29, 82:1-82:10.
3. BENSON, R. V. 1966. Euclidean Geometry and Convexity. McGraw-Hill, New York.
4. BERGEN, G. 2001. Proximity queries and penetration depth computation on 3d game objects. In Proceedings of the Game Developers Conference.
5. CAMERON, S. 1997. Enhancing GJK: Computing minimum and penetration distance between convex polyhedra. In Proceedings of the International Conference on Robotics and Automation. 3112-3117.
6. CAMERON, S. A. AND CULLEY, R. K. 1986. Determining the minimum translational distance between two convex polyhedra. In Proceedings of the IEEE International Conference on Robotics and Automation. 591-596. (Pubitemid 16616205)
7. CHOI,Y.-K., LI, X., RONG, F.,WANG,W., AND CAMERON, S. 2006. Computing the minimum directional distance between two convex polyhedra. HKU CS Tech. rep. TR-2006-01.
8. COTTLE, R., PANG, J., AND STONE, R. 2009. The Linear Complementarity Problem. SIAM.
9. DOBKIN, D., HERSHBERGER, J., KIRKPATRICK, D., AND SURI, S. 1993. Computing the intersection-depth of polyhedra. Algorithmica 9, 518-533. (Pubitemid 23668713)
10. FISHER, S. AND LIN,M. C. 2001. Fast penetration depth estimation for elastic bodies using deformed distance fields. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems.
11. GOLUB, G. H. AND VAN LOAN, C. F. 1996. Matrix Computations 3rd Ed. Johns Hopkins University Press, Baltimore, MD.
12. GUENDELMAN, E., BRIDSON, R., AND FEDKIW, R. 2003. Nonconvex rigid bodies with stacking. ACM Trans. Graph. 22, 3, 871-878.
13. HACHENBERGER, P. 2009. Exact Minkowski sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces. Algorithmica 55, 2, 329-345.
14. HOFF, K., CULVER, T., KEYSER, J., LIN, M., AND MANOCHA, D. 1999. Fast computation of generalized Voronoi diagrams using graphics hardware. In Proceedings of ACM SIGGRAPH Conference. 277-286.
15. HOFF, K.,ZAFERAKIS, A.,LIN,M., ANDMANOCHA,D. 2002. Fast 3d geometric proximity queries between rigid and deformable models using graphics hardware acceleration. Tech. rep. TR02-004, Department of Computer Science, University of North Carolina.
16. JOURDAN, F., ALART, P., AND JEAN, M. 1998. A Gauss-Seidel like algorithm to solve frictional contact problems. Comput. Methods Appl. Mechan. Engin. 155, 1-2, 31-47.
17. KIM,Y.,LIN,M., ANDMANOCHA,D. 2004a. Fast penetration depth estimation using rasterization hardware and hierarchical refinement. In Algorithmic Foundations of Robotics V, Springer Tracts in Advanced Robotics, vol. 7, Springer, 505-522.
18. KIM, Y. J.,LIN, M., ANDMANOCHA, D. 2004b. Incremental penetration depth estimation between convex polytopes using dual-space expansion. IEEE Trans. Vis. Comput. Graph. 10, 1, 152-164.
19. KIM, Y. J., OTADUY, M. A., LIN, M. C., AND MANOCHA, D. 2002. Fast penetration depth computation for physically-based animation. In Proceedings of the ACM Symposium on Computer Animation.
20. KIM, Y. J.,OTADUY,M. A., LIN, M. C., ANDMANOCHA, D. 2003. Six-degreeof- freedom haptic rendering using incremental and localized computations. Presence 12, 3, 277-295. (Pubitemid 36739309)
21. LARSEN, E.,GOTTSCHALK, S., LIN,M., ANDMANOCHA,D. 2000. Fast distance queries with rectangular swept sphere volumes. In Proceedings of the IEEE International Conference on Robotics and Automation. 3719-3726.
22. LATOMBE, J.-C. 1991. Robot Motion Planning. Kluwer Academic Publishers.
23. LIEN, J.-M. 2008. Covering Minkowski sum boundary using points with applications. Comput. Aid. Geom. Des. 25, 8, 652-666.
24. LIEN, J.-M. 2009. Asimplemethod for computingMinkowski sum boundary in 3d using collision detection. In Algorithmic Foundation of Robotics VIII,G.Chirikjian,H.Choset, M. Morales, and T. Murphey, Eds., Springer Tracts in Advanced Robotics, vol. 57, Springer, 401-415.
25. LIN,M. ANDMANOCHA,D. 2003. Collision and proximity queries. Handbook Discr. Comput. Geom. 787-807.
26. LIN, M. C. 1993. Efficient collision detection for animation and robotics. Ph.D. thesis, University of California, Berkeley, CA.
27. MIRTICH, B. V. 1996. Impulse-Based dynamic simulation of rigid body systems. Ph.D. thesis.
28. NAWRATIL, G., POTTMANN, H., ANDRAVANI,B. 2009. Generalized penetration depth computation based on kinematical geometry. Comput. Aided Geom. Des. 26, 425-443.
29. ONG, C. 1993. Penetration distances and their applications to path planning. Ph.D. thesis, Michigan University, Ann Arbor.
30. ONG, C. J. AND GILBERT, E. 1996. Growth distances: New measures for object separation and penetration. IEEE Trans. Robot. Autom. 12, 6, 888-903. (Pubitemid 126784480)
31. REDON, S. 2004. Fast continuous collision detection and handling for desktop virtual prototyping. Virtual Reality 8, 63-70. (Pubitemid 41348884)
32. REDON, S., KHEDDAR, A., AND COQUILLART, S. 2002. Gauss' least constraints principle and rigid body simulations. In Proceedings of IEEE International Conference on Robotics and Automation. 11-15.
33. REDON, S. AND LIN, M. C. 2006. A fast method for local penetration depth computation. J. Graph. Tools 11, 2, 37-50.
34. SUD, A., GOVINDARAJU, N., GAYLE, R., KABUL, I., AND MANOCHA, D. 2006. Fast proximity computation among deformable models using discrete Voronoi diagrams. In Proceedings of the ACM, SIGGRAPH. ACM, New York. 1144-1153. (Pubitemid 44481078)
35. TANG, M., KIM, Y. J., AND MANOCHA, D. 2009a. C2A: controlled conservative advancement for continuous collision detection of polygonal models. In Proceedings of the IEEE International Conference on Robotics and Automation. 356-361.
36. TANG, M., LEE, M., AND KIM, Y. J. 2009b. Interactive Hausdorff distance computation for general polygonal models. ACMTrans. Graph. 28, 74:1- 74:9.
37. WELLER, R. AND ZACHMANN, G. 2009. Inner sphere trees for proximity and penetration queries. In Proceedings of Robotics: Science and Systems Conference.
38. ZHANG, L., KIM, Y., AND MANOCHA, D. 2007a. A fast and practical algorithm for generalized penetration depth computation. In Proceedings of Robotics: Science and Systems Conference.
39. ZHANG, L., KIM, Y., AND MANOCHA, D. 2008. Efficient cell labelling and path non-existence computation using c-obstacle query. Int. J. Robot. Res. 27, 11-12, 1246-1257.
40. ZHANG, L., KIM, Y., VARADHAN, G., AND MANOCHA, D. 2007b. Generalized penetration depth computation. Comput.-Aid. Des. 39, 8, 625-638. (Pubitemid 47016475)
41. ZHANG, L. AND MANOCHA, D. 2008. An efficient retraction-based RRT planner. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA). 3743-3750.
42. ZHANG, X., LEE, M., AND KIM, Y. J. 2006. Interactive continuous collision detection for non-convex polyhedra. Vis. Comput. 22, 749-760. (Pubitemid 44371183)
43. ZHANG, X., REDON, S., LEE, M., AND KIM, Y. J. 2007c. Continuous collision detection for articulated models using Taylormodels and temporal culling. ACM Trans. Graph. 26, 3, 15.