Generalized penetration depth computation

Proceedings SPM 2006 - ACM Symposium on Solid and Physical Modeling

Volumn 2006, Issue , 2006, Pages 173-184

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

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b Ewha Womans University   (South Korea)

Author keywords

Penetration depth

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MOTION ESTIMATION; MOTION PLANNING; OPTIMIZATION; PROBLEM SOLVING;

DEPTH COMPUTATIONS; PD COMPUTATION; ROTATIONAL MOTION; TRANSLATIONAL MOTION;

COMPUTATION THEORY;

EID: 33745965450     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1128888.1128914     Document Type: Conference Paper

References (36)

1. AGARWAL, P., AMENTA, N., AND SHARIR, M. 1998. Largest placement of one convex polygon inside another. In Discrete Comput. Geom, vol. 19, 95-104.
2. AGARWAl, P., GUIBAS, L., HAR-PELED, S., RABINOVITCH, A., AND SHARIR, M. 2000. Penetration depth of two convex polytopes in 3d. Nordic J. Computing 7, 227-240.
3. AMATO, N., BAYAZIT, O., DALE, L., JONES, C., AND VALLEJO, D. 2000. Choosing good distance metrics and local planners for probabilistic roadmap methods. In IEEE Transactions on Robotics and Automation, vol. 16, 442-447.
4. AVNAIM, F., AND BOISSONNAT, J. 1989. Polygon placement under translation and rotation. In ITA, vol. 23, 5-28.
5. CAMERON, S. 1997. Enhancing GJK: Computing minimum and penetration distance between convex polyhedra. IEEE International Conference on Robotics and Automation. 3112-3117.
6. CHAZELLE, B. 1983. The polygon containment problem. Advances in Computing Research 1, 1-33.
7. COHEN-OR, D., LEV-YEHUDI, S., KAROL, A., AND TAL, A. 2002. Inner-cover of non-convex shapes. In The 4th Israel-Korea Bi-National Conference on Geometric Modeling.
8. DOBKIN, D., HERSHBERGER, J., KIRKPATRICK, D., AND SURI, S. 1993. Computing the intersection-depth of polyhedra. Algorithmica 9, 518-533.
9. EHMANN, S., AND LIN, M. 2001. Accurate and fast proximity queries between polyhedra using surface decomposition. In Proc. of Eurographics.
10. GOTTSCHALK, S., LIN, M., AND MANOCHA, D. 1996. OBB-Tree: A hierarchical structure for rapid interference detection. Proc. of ACM Siggraph'96, 171-180.
11. GRINDE, R., AND CAVALIER, T. 1996. Containment of a single polygon using mathematical programming. In European Journal of Operational Research, Elsevier Science, vol. 92, 368-386.
12. HALPERIN, D. 1997. Arrangements. In Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O'Rourke, Eds. CRC Press LLC, Boca Raton, FL, ch. 21, 389-412.
13. HALPERIN, D. 2002. Robust geometric computing in motion. International Journal of Robotics Research, 21(3).
14. HALPERIN, D. 2005. Private communication
15. HSU, D., KAVRAKI, L., LATOMBE, J., MOTWANI, R., AND SORKIN, S. 1998. On finding narrow passages with probabilistic roadmap planners. Proc. of 3rd Workshop on Algorithmic Foundations of Robotics, 25-32.
16. KIM, Y. J., LIN, M. C., AND MANOCHA, D. 2002. Fast penetration depth computation using rasterization hardware and hierarchical refinement. Proc:. of Workshop on Algorithmic Foundations of Robotics.
17. KIM, Y., LIN, M., AND MANOCHA, D. 2002. Deep: Dual-space expansion for estimating penetration depth between convex polytopes. In Proc. IEEE International Conference on Robotics and Automation.
18. KIM, Y. J., OTADUY, M. A., LIN, M. C., AND MANOCHA, D. 2003. Six-degree-of-freedom haptic rendering using incremental and localized computations. Presence 12, 3, 277-295.
19. KUFFNER, J. 2004. Effective sampling and distance metrics for 3d rigid body path planning. In IEEE Int'l Conf. on Robotics and Automation.
20. LATOMBE, J. 1991. Robot Motion Planning. Kluwer Academic Publishers.
21. LAVALLE, S. M. 2006. Planning Algorithms. Cambridge University Press (also available at http://msl.cs.uiuc.edu/planning/), to appear.
22. LIN, M., AND MANOCHA, D. 2003. Collision and proximity queries. In Handbook of Discrete and Computational Geometry.
23. MILENKOVIC, V., AND SCHMIDL, H. 2001. Optimization based animation. In ACM SIGGRAPH 2001.
24. MILENKOVIC, V. 1998. Rotational polygon overlap minimization and compaction. In Computational Geometry, vol. 10, 305-318.
25. MILENKOVIC, V. 1999. Rotational polygon containment and minimum enclosure using only robust 2d constructions. In Computational Geometry, vol. 13, 3-19.
26. MIRTICH, B. 2000. Timewarp rigid body simulation. Proc. of ACM SIGGRAPH.
27. MOUNT, D. 1992. Intersection detection and separators for simple polygons. In Proc. 8th Annual ACM Sympos. Comput, Geom, 303-311.
28. RAAB, S. 1999. Controlled perturbation for arrangements of polyhedral surfaces with application to swept volumes. In Proc. 15th ACM Symposium on Computational Geometry, 163-172.
29. REDON, S., AND LIN, M. 2005. A fast method for local penetration depth computation. Journal of Graphical Tools.
30. REQUICHA, A. 1993. Mathematical definition of tolerance specifications. ASME Manufacturing Review 6, 4, 269-274.
31. SCHWARZER, F., SAHA, M., AND LATOMBE, J. 2005. Adaptive dynamic collision checking for single and multiple articulated robots in complex environments. IEEE Tr. on Robotics 21, 3 (June), 338-353.
32. STEWART, D. E., AND TRINKLE, J. C. 1996. An implicit time-stepping scheme for rigid body dynamics with inelastic collisions and coulomb friction. International Journal of Numerical Methods in Engineering 39, 2673-2691.
33. VAN DEN BERGEN, G. 2001. Proximity queries and penetration depth computation on 3d game objects. Game Developers Conference.
34. VARADHAN, G., AND MANOCHA, D. 2005. Star-shaped roadmaps - a determinstic sampling approach for complete motion planning. In Proc. of Robotics: Science and Systems.
35. ZHANG, L., KIM, Y., AND MANOCHA, D. 2006. A simple path non-existence algorithm for low dof robots. Tech. Rep. 06-006, Department of Computer Science, University of North Carolina at Chapel Hill.
36. ZHANG, L., KIM, Y., VARADHAN, G., AND D.MANOCHA. 2006. Fast c-obstacle query computation for motion planning. In IEEE International Conference on Robotics and Automation (ICRA 2006).