Generalized penetration depth computation

CAD Computer Aided Design

Volumn 39, Issue 8, 2007, Pages 625-638

  Zhang, Liangjun ^a   Kim, Young J ^b   Varadhan, Gokul ^a   Manocha, Dinesh ^a  

^a Brooks Computer Science Building   (United States)

^b Ewha Womans University   (South Korea)

Author keywords

Penetration depth

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; MOTION ESTIMATION;

PENETRATION DEPTH; PENETRATION DEPTH COMPUTATION; ROTATIONAL MOTION;

DISTANCE MEASUREMENT;

EID: 34347343839     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cad.2007.05.012     Document Type: Article

References (42)

1. Agarwal P., Amenta N., and Sharir M. Largest placement of one convex polygon inside another. Discrete Computational Geometry 19 (1998) 95-104
2. Agarwal P., Guibas L., Har-Peled S., Rabinovitch A., and Sharir M. Penetration depth of two convex polytopes in 3D. Nordic Journal of Computing 7 (2000) 227-240
3. Amato N., Bayazit O., Dale L., Jones C., and Vallejo D. Choosing good distance metrics and local planners for probabilistic roadmap methods. IEEE Transactions on Robotics and Automation 16 4 (2000) 442-447
4. Avnaim F., and Boissonnat J. Polygon placement under translation and rotation. Information Theories and Applications 23 (1989) 5-28
5. Cameron S. Enhancing GJK: Computing minimum and penetration distance between convex polyhedra. In: IEEE international conference on robotics and automation. 1997. p. 3112-7
6. Chazelle B. The polygon containment problem. Advances in Computing Research 1 (1983) 1-33
7. Cohen-Or D, Lev-Yehudi S, Karol A, Tal A. Inner-cover of non-convex shapes. In: The 4th Israel-Korea bi-national conference on geometric modeling. 2002
8. Dobkin D., Hershberger J., Kirkpatrick D., and Suri S. Computing the intersection-depth of polyhedra. Algorithmica 9 (1993) 518-533
9. Ehmann S, Lin M. Accurate and fast proximity queries between polyhedra using surface decomposition. In: Proc. of eurographics. 2001
10. Gottschalk S, Lin M, Manocha D. OBB-tree: A hierarchical structure for rapid interference detection. In: Proc. of ACM Siggraph'96. 1996. p. 171-80
11. Grinde R., and Cavalier T. Containment of a single polygon using mathematical programming. European Journal of Operational Research 92 (1996) 368-386
12. Halperin D. Robust geometric computing in motion. International Journal of Robotics Research 21 3 (2002)
13. Halperin D. Arrangements. In: Goodman J.E., and O'Rourke J. (Eds). Handbook of discrete and computational geometry (2004), CRC Press LLC, Boca Raton (FL) 529-562 [chapter 24]
14. Hsu D, Kavraki L, Latombe J, Motwani R, Sorkin S. On finding narrow passages with probabilistic roadmap planners. In: Proc. of 3rd workshop on algorithmic foundations of robotics. 1998. p. 25-32
15. Hsu D., Latombe J.-C., and Motwani R. Path planning in expansive configuration spaces. International Journal of Computational Geometry and Applications 9 4-5 (1999) 495-512
16. Kim YJ, Lin MC, Manocha D. Fast penetration depth computation using rasterization hardware and hierarchical refinement. In: Proc of workshop on algorithmic foundations of robotics. 2002
17. Kim Y, Lin M, Manocha D. Deep: Dual-space expansion for estimating penetration depth between convex polytopes. In: Proc IEEE international conference on robotics and automation. 2002
18. Kim Y.J., Otaduy M.A., Lin M.C., and Manocha D. Six-degree-of-freedom haptic rendering using incremental and localized computations. Presence 12 3 (2003) 277-295
19. Kuffner J. Effective sampling and distance metrics for 3d rigid body path planning. In: IEEE Int'l conf on robotics and automation. 2004
20. Latombe J. Robot motion planning (1991), Kluwer Academic Publishers
21. LaValle S.M. Planning algorithms (2006), Cambridge University Press. http://msl.cs.uiuc.edu/planning/ Also available at:
22. Lin M., and Manocha D. Collision and proximity queries. Handbook of discrete and computational geometry (2003)
23. Milenkovic V, Schmidl H. Optimization based animation. In: ACM SIGGRAPH 2001. 2001
24. Milenkovic V. Rotational polygon overlap minimization and compaction. Computational Geometry 10 (1998) 305-318
25. Milenkovic V. Rotational polygon containment and minimum enclosure using only robust 2D constructions. Computational Geometry 13 (1999) 3-19
26. Mirtich B. Timewarp rigid body simulation. In: Proc of ACM SIGGRAPH. 2000
27. Mount D. Intersection detection and separators for simple polygons. In: Proc. 8th annual ACM sympos. comput. geom. 1992. p. 303-11
28. Ong C., and Gilbert E. Growth distances: New measures for object separation and penetration. IEEE Transactions on Robotics and Automation 12 (1996) 6
29. Ong C. Penetration distances and their applications to path planning. Ph.D. thesis. Ann Arbor: Michigan Univ.; 1993
30. Ong C. On the quantification of penetration between general objects. International Journal of Robotics Research 16 3 (1997) 400-409
31. Park F. Distance metrics on the rigid-body motions with applications to mechanism design. ASME Journal of Mechanical Design 117 1 (1995) 48-54
32. Raab S. Controlled perturbation for arrangements of polyhedral surfaces with application to swept volumes. In: Proc. 15th ACM symposium on computational geometry. 1999. p. 163-72
33. Redon S., and Lin M. A fast method for local penetration depth computation. Journal of Graphics Tools 11 2 (2006) 37-50
34. Requicha A. Mathematical definition of tolerance specifications. ASME Manufacturing Review 6 4 (1993) 269-274
35. Schwarzer F., Saha M., and Latombe J. Adaptive dynamic collision checking for single and multiple articulated robots in complex environments. IEEE Transactions on Robotics 21 3 (2005) 338-353
36. Stewart D.E., and Trinkle J.C. An implicit time-stepping scheme for rigid body dynamics with inelastic collisions and Coulomb friction. International Journal of Numerical Methods in Engineering 39 (1996) 2673-2691
37. van den Bergen G. Proximity queries and penetration depth computation on 3D game objects. In: Game developers conference. 2001
38. Varadhan G, Manocha D. Star-shaped roadmaps - A determinstic sampling approach for complete motion planning. In: Proc of robotics: Science and systems. 2005
39. Zhang L, Kim Y, Manocha D. A hybrid approach for complete motion planning. In: IEEE/RSJ international conference on intelligent robots and systems. 2007
40. Zhang L, Kim Y, Manocha D. A simple path non-existence algorithm using c-obstacle query for low dof robots. In: International workshop on the algorithmic foundations of robotics. 2006
41. Zhang L, Kim Y, Manocha D. C-DIST: Efficient distance computation for rigid and articulated models in configuration space. In: ACM solid and physical modeling symposium. 2007. p. 159-69
42. Zhang L, Kim Y, Manocha D. A fast and practical algorithm for generalized penetration depth computation. In: Proceedings of robotics: Science and systems. 2007