Fast penetration depth estimation using rasterization hardware and hierarchical refinement

Springer Tracts in Advanced Robotics

Volumn 7 STAR, Issue , 2004, Pages 505-521

  Kim, Young J ^a   Lin, Ming C ^a   Manocha, Dinesh ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDING VOLUME HIERARCHIES; COMPLEX MODEL; FAST ALGORITHMS; MINKOWSKI SUM; MODEL SIMPLIFICATION; POLYHEDRAL MODELS; RASTERIZATION;

HARDWARE; ROBOTICS;

ALGORITHMS;

EID: 84863277679     PISSN: 16107438     EISSN: 1610742X     Source Type: Book Series    
DOI: 10.1007/978-3-540-45058-0_30     Document Type: Conference Paper

References (31)

1. P. Agarwal, L. J. Guibas, S. Har-Peled, A. Rabinovitch, and M. Sharir. Penetration depth of two convex polytopes in 3D. Nordic J. Computing, 7:227-240, 2000.
2. Boris Aronov, Micha Sharir, and Boaz Tagansky. The union of convex polyhedra in three dimensions. SIAM J. Comput., 26:1670-1688, 1997.
3. B. Barber, D. Dobkin, and H. Huhdanpaa. The quickhull algorithm for convex hull. Technical Report GCG53, The Geometry Center, MN, 1993.
4. G. Bergen. Proximity queries and penetration depth computation on 3D game objects. Game Developers Conference, 2001.
5. S. Cameron. Enhancing GJK: Computing minimum and penetration distance between convex polyhedra. Proceedings of International Conference on Robotics and Automation, pages 3112-3117, 1997.
6. S. Cameron and R. K. Culley. Determining the minimum translational distance between two convex polyhedra. Proceedings of International Conference on Robotics and Automation, pages 591-596, 1986.
7. Bernard Chazelle, D. Dobkin, N. Shouraboura, and A. Tal. Strategies for polyhedral surface decomposition: An experimental study. Comput. Geom. Theory Appl., 7:327-342, 1997.
8. D. Dobkin, J. Hershberger, D. Kirkpatrick, and Subhash Suri. Computing the intersection-depth of polyhedra. Algorithmica, 9:518-533, 1993.
9. S. Ehmann and M. C. Lin. Accurate and fast proximity queries between polyhedra using convex surface decomposition. Computer Graphics Forum (Proc. of Eurographics'2001), 20(3), 2001.
10. S. Fisher and M. C. Lin. Deformed distance fields for simulation of non-penetrating flexible bodies. Proc. of EG Workshop on Computer Animation and Simulation, 2001.
11. M. Garland and P. Heckbert. Surface simplification using quadric error bounds. Proc. of ACM SIGGRAPH, pages 209-216, 1997.
12. A. Gregory, A. Mascarenhas, S. Ehmann, M. C. Lin, and D. Manocha. 6-DOF haptic display of polygonal models. Proc. of IEEE Visualization Conference, 2000.
13. L. Guibas and R. Seidel. Computing convolutions by reciprocal search. Discrete Comput. Geom, 2:175-193, 1987.
14. K. Hoff, A. Zaferakis, M. Lin, and D. Manocha. Fast and simple geometric proximity queries using graphics hardware. Proc. of ACM Symposium on Interactive 3D Graphics, 2001.
15. D. Hsu, L. Kavraki, J. Latombe, R. Motwani, and S. Sorkin. On finding narrow passages with probabilistic roadmap planners. Proc. of 3rd Workshop on Algorithmic Foundations of Robotics, 1998.
16. A. Kaul and J. Rossignac. Solid-interpolating deformations: construction and animation of PIPS. Computer and Graphics, 16:107-116, 1992.
17. Y. Kim, K. Hoff, M. Lin, and D. Manocha. Closest point query among the union of convex polytopes using rasterization hardware. Journal of Graphics Tools, 2003. to appear.
18. Y. Kim, M. Lin, and D. Manocha. DEEP: Dual-space Expansion for Estimating Penetration depth between convex polytopes. In IEEE Conference on Robotics and Automation, 2002.
19. Y. Kim, M. Otaduy, M. Lin, and D. Manocha. Fast penetration depth computation for physically-based animation. In ACM Symposium on Computer Animation, 2002.
20. Y. Kim, M. Otaduy, M. Lin, and D. Manocha. Fast penetration depth computation using rasterization hardware and hierarchical refinement. Technical report, UNC-Chapel Hill TR02-014, 2002.
21. S. Krishnan, N. Mustafa, and S. Venkatasubramanian. Hardware-assisted computation of depth contours. In ACM-SIAM Symposium on Discrete Algorithms, 2002.
22. M. Lin and S. Gottschalk. Collision detection between geometric models: A survey. In Proc. of IMA Conference on Mathematics of Surfaces, 1998.
23. M.C. Lin and John F. Canny. Efficient algorithms for incremental distance computation. In IEEE Conference on Robotics and Automation, pages 1008-1014, 1991.
24. Michael McKenna and David Zeltzer. Dynamic simulation of autonomous legged locomotion. In Forest Baskett, editor, Computer Graphics (SIGGRAPH '90 Proceedings), volume 24, pages 29-38, August 1990.
25. W. McNeely, K. Puterbaugh, and J. Troy. Six degree-of-freedom haptic rendering using voxel sampling. Proc. of ACM SIGGRAPH, pages 401-408, 1999.
26. B. Mirtich. Timewarp rigid body simulation. Proc. of ACM SIGGRAPH, 2000.
27. C. J. Ong and E.G. Gilbert. Growth distances: New measures for object separation and penetration. IEEE Transactions on Robotics and Automation, 12(6), 1996.
28. G. D. Ramkumar. Tracings and Their Convolution: Theory and Applications. PhD thesis, Standford, March 1998.
29. A.A.G. Requicha. Mathematical definition of tolerance specifications. ASME Manufacturing Review, 6(4):269-274, 1993.
30. D. E. Stewart and J. C. Trinkle. 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, 1996.
31. T. Theoharis, G. Papaiannou, and E. Karabassi. The magic of the Z-buffer: A survey. Proc. of 9th International Conference on Computer Graphics, Visualization and Computer Vision, WSCG, 2001.