×

Interactive generalized penetration depth computation for rigid and articulated models using object norm. (English) Zbl 1288.68217

MSC:

68T40 Artificial intelligence for robotics
68W25 Approximation algorithms
68U05 Computer graphics; computational geometry (digital and algorithmic aspects)

Software:

SIMEM3 Renault
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] P. K. Agarwal, L. J. Guibas, S. Har-Peled, A. Rabinovitch, and M. Sharir. 2000. Penetration depth of two convex polytopes in 3d. Nordic J. Comput. 7, 227–240. · Zbl 0977.68088
[2] J. Allard, F. Faure, H. Courtecuisse, F. Falipou, C. Duriez, and P. G. Kry. 2010. Volume contact constraints at arbitrary resolution. ACM Trans. Graph. 29, 4. · doi:10.1145/1778765.1778819
[3] J. Baumgarte. 1972. Stabilization of constraints and integrals of motion in dynamical systems. Comput. Methods Appl. Mech. Engin. 1, 1, 1–16. · Zbl 0262.70017 · doi:10.1016/0045-7825(72)90018-7
[4] G. Bergen. 2001. Proximity queries and penetration depth computation on 3d game objects. In Proceedings of the Game Developers Conference.
[5] S. Cameron. 1997. Enhancing gjk: Computing minimum and penetration distance between convex polyhedra. In Proceedings of the International Conference on Robotics and Automation. 3112–3117. · doi:10.1109/ROBOT.1997.606761
[6] S. A. Cameron and R. K. Culley. 1986. Determining the minimum translational distance between two convex polyhedra. In Proceedings of the IEEE International Conference on Robotics and Automation. 591–596.
[7] E. Catto. 2005. Iterative dynamics with temporal coherence. In Proceedings of the Game Developers Conference.
[8] D. Dobkin, J. Hershberger, D. Kirkpatrick, and S. Suri. 1993. Computing the intersection-depth of polyhedra. Algorithmica 9, 518–533. · Zbl 0797.68162 · doi:10.1007/BF01190153
[9] S. Fisher and M. C. Lin. 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. · doi:10.1109/IROS.2001.973379
[10] C. Goldfeder, M. Ciocarlie, H. Dang, and P. K. Allen. 2009. The columbia grasp database. In International Conference on Robotics and Automation.
[11] P. Hachenberger. 2009. Exact minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces. Algorithmica 55, 2, 329–345. · Zbl 1186.68500 · doi:10.1007/s00453-008-9219-6
[12] G. D. Hart, B. M. Riviere, and G. D. Hart. 2002. A constraint-stabilized time-stepping approach for rigid multibody dynamics with joints, contact and friction. In Proceedings of the International Journal for Numerical Methods in Engineering. 2335–2371. · Zbl 1075.70501
[13] M. Hofer and H. Pottmann. 2004. Energy-minimizing splines in manifolds. In Proceedings of the ACM SIGGRAPH Conference. · doi:10.1145/1186562.1015716
[14] K. Hoff, A. Zaferakis, M. Lin, and D. Manocha. 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.
[15] C. Je, M. Tang, Y. Lee, M. Lee, and Y. Kim. 2012. PolyDepth: Real-time penetration depth computation using iterative contact-space projection. ACM Trans. Graph. 31, 1. · doi:10.1145/2077341.2077346
[16] F. Jourdan, P. Alart, and M. Jean. 1998. A gauss-seidel like algorithm to solve frictional contact problems. Comput. Methods Appl. Mech. Engin. 155, 1–2, 31–47. · Zbl 0961.74080
[17] K. Kazerounian and J. Rastegar. 1992. Object norms: A class of coordinate and metric independent norms for displacement. In Proceedings of the ASME Design Engineering Technical Conference.
[18] Y. J. Kim, M. C. Lin, and D. Manocha. 2004. Incremental penetration depth estimation between convex polytopes using dual-space expansion. IEEE Trans. Vis. Comput. Graph. 10, 1, 152–164. · Zbl 05108211 · doi:10.1109/TVCG.2004.1260767
[19] Y. J. Kim, M. A. Otaduy, M. C. Lin, and D. Manocha. 2002. Fast penetration depth computation for physically-based animation. In Proceedings of the ACM Symposium on Computer Animation. · doi:10.1145/545261.545266
[20] Y. J. Kim, M. A. Otaduy, M. C. Lin, and D. Manocha. 2003. Six-degree-of-freedom haptic rendering using incremental and localized computations. Presence 12, 3, 77–295. · Zbl 05438834 · doi:10.1162/105474603765879530
[21] J. J. Kuffner and S. M. LaValle. 2000. RRT-Connect: An efficient approach to single-query path planning. In Proceedings of the IEEE International Conference on Robotics and Automation. · doi:10.1109/ROBOT.2000.844730
[22] E. Larsen, S. Gottschalk, M. C. Lin, and D. Manocha. 2000. Fast proximity queries with swept sphere volumes. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA’00). 3719–3726.
[23] J. Lien. 2008. Covering minkowski sum boundary using points with applications. Comput. Aided Geom. Des. 25, 8, 652–666. · Zbl 1172.65338 · doi:10.1016/j.cagd.2008.06.006
[24] J. Lien. 2009. A simple method for computing minkowski 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. · Zbl 1215.68239
[25] B. Mirtich. 1996. Impulse-based dynamic simulation of rigid body systems. Ph.D. dissertation, University of California, Berkeley.
[26] M. Moore and J. Wilhelms. 1988. Collision detection and response for computer animation. In Proceedings of the 15<sup>th</sup> Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH’88). J. Dill, Ed., 289–298. · doi:10.1145/54852.378528
[27] G. Nawratil, H. Pottmann, and B. Ravani. 2009. Generalized penetration depth computation based on kinematical geometry. Comput. Aided Geom. Des. 26, 4, 425–443. · Zbl 1205.70007 · doi:10.1016/j.cagd.2009.01.001
[28] C. J. Ong. 1993. Penetration distances and their applications to path planning. Ph.D. dissertation, Michigan University, Ann Arbor.
[29] C. J. Ong and E.G. Gilbert. 1996. Growth distances: New measures for object separation and penetration. IEEE Trans. Robotics Automation 12, 6, 888–903. · doi:10.1109/70.544772
[30] M. Ortega, S. Redon, and S. Coquillart. 2007. A six degree-of-freedom god-object method for haptic display of rigid bodies with surface properties. IEEE Trans. Vis. Comput. Graph. 13, 3, 458–469. · Zbl 05339867 · doi:10.1109/TVCG.2007.1028
[31] M. A. Otaduy, R. Tamstorf, D. Steinemann, and M. Gross. 2009. Implicit contact handling for deformable objects. Comput. Graph. Forum 28, 2. · Zbl 05650515 · doi:10.1111/j.1467-8659.2009.01396.x
[32] J. Pan, L. Zhang, and D. Manocha. 2010. Retraction-based rrt planner for articulated models. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA’10).
[33] S. Redon, A. Kheddar, and S. Coquillart. 2002. Gauss’ least constraints principle and rigid body simulations. In Proceedings of the IEEE International Conference on Robotics and Automation. 11–15.
[34] S. Redon and M. Lin. 2005. Practical local planning in the contact space. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA’05). · doi:10.1109/ROBOT.2005.1570765
[35] S. Redon and M. C. Lin. 2006. A fast method for local penetration depth computation. J. Graph. Tools 11, 2, 7–50.
[36] D. C. Ruspini and O. Khatib. 1997. Collision/contact models for the dynamic simulation of complex environments. In Proceedings of the 9<sup>th</sup> International Symposium of Robotics Research.
[37] H. Schmidl, N. Walker, and M. C. Lin. 2004. CAB: Fast update of obb trees for collision detection between articulated bodies. J. Graph. Tools 9, 1–9. · Zbl 02179916 · doi:10.1080/10867651.2004.10504891
[38] A. Sud, N. Govindaraju, R. Gayle, I. Kabul, and D. Manocha. 2006. Fast proximity computation among deformable models using discrete voronoi diagrams. In Proceedings of the ACM SIGGRAPH Papers. 1144–1153.
[39] M. Tang, Y. J. Kim, and D. Manocha. 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.
[40] M. Tang, M. Lee, and Y. J. Kim. 2009b. Interactive hausdorff distance computation for general polygonal models. ACM Trans. Graph. 28, 3. · doi:10.1145/1531326.1531380
[41] B. Wang, F. Faure, and D. K. Pai. 2012. Adaptive Image-based intersection volume. ACM Trans. Graph. 31, 4. · doi:10.1145/2185520.2185593
[42] R. Weller and G. Zachmann. 2009. Inner sphere trees for proximity and penetration queries. In Proceedings of the Robotics: Science and Systems Conference.
[43] L. Zhang, Y. J. Kim, and D. Manocha. 2007a. A fast and practical algorithm for generalized penetration depth computation. In Proceedings of Robotics: Science and Systems Conference. · Zbl 1354.65032 · doi:10.15607/RSS.2007.III.034
[44] L. Zhang, Y. J. Kim, and D. Manocha. 2007b. C-DIST: Efficient distance computation for rigid and articulated models in configuration space. In Proceedings of the ACM Solid and Physical Modeling Conference (SPM’07). · doi:10.1145/1236246.1236270
[45] L. Zhang, Y. J. Kim, and D. Manocha. 2008. Efficient cell labelling and path non-existence computation using c-obstacle query. Int. J. Robotics Res. 27, 11–12, 1246–1257.
[46] L. Zhang, Y. J. Kim, G. Varadhan, and D. Manocha. 2007c. Generalized penetration depth computation. Comput.-Aid. Des. 39, 8, 625–638. · Zbl 05861430 · doi:10.1016/j.cad.2007.05.012
[47] L. Zhang and D. Manocha. 2008. An efficient retraction-based rrt planner. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA’08). 3743–3750.
[48] X. Zhang, S. Redon, M. Lee, and Y. J. Kim. 2007d. Continuous collision detection for articulated models using taylor models and temporal culling. ACM Trans. Graph. 26, 3. · Zbl 05457812 · doi:10.1145/1276377.1276396
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.