Author manuscript, published in "Journal of graphics tools (2006)" A Fast Method for Local Penetration Depth Computation
暂无分享,去创建一个
[1] Ming C. Lin,et al. Haptic display of interaction between textured models , 2004, IEEE Visualization 2004.
[2] Dinesh Manocha,et al. DEEP: dual-space expansion for estimating penetration depth between convex polytopes , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).
[3] F. A. Seiler,et al. Numerical Recipes in C: The Art of Scientific Computing , 1989 .
[4] Jarek Rossignac,et al. Solid-interpolating deformations: Construction and animation of PIPs , 1991, Comput. Graph..
[5] Tomas Akenine-Möller,et al. A Fast Triangle-Triangle Intersection Test , 1997, J. Graphics, GPU, & Game Tools.
[6] Dinesh Manocha,et al. OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.
[7] MöllerTomas. A fast triangle-triangle intersection test , 1997 .
[8] William H. Press,et al. The Art of Scientific Computing Second Edition , 1998 .
[9] Stephen Cameron,et al. Enhancing GJK: computing minimum and penetration distances between convex polyhedra , 1997, Proceedings of International Conference on Robotics and Automation.
[10] Leonidas J. Guibas,et al. Computing convolutions by reciprocal search , 1986, SCG '86.
[11] Gino van den Bergen. Proximity Queries and Penetration Depth Computation on 3D Game Objects , 2001 .