H-Walk: hierarchical distance computation for moving convex bodies
暂无分享,去创建一个
[1] Leonidas J. Guibas,et al. A new representation for linear lists , 1977, STOC '77.
[2] Herbert Edelsbrunner,et al. Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.
[3] David G. Kirkpatrick,et al. A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.
[4] S. Sathiya Keerthi,et al. A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..
[5] David G. Kirkpatrick,et al. Determining the Separation of Preprocessed Polyhedra - A Unified Approach , 1990, ICALP.
[6] Ming C. Lin,et al. A fast algorithm for incremental distance calculation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.
[7] Sean Quinlan,et al. Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.
[8] Dinesh Manocha,et al. I-COLLIDE: an interactive and exact collision detection system for large-scale environments , 1995, I3D '95.
[9] Philip M. Hubbard,et al. Collision Detection for Interactive Graphics Applications , 1995, IEEE Trans. Vis. Comput. Graph..
[10] Dinesh Manocha,et al. OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.
[11] Stephen Cameron,et al. Enhancing GJK: computing minimum and penetration distances between convex polyhedra , 1997, Proceedings of International Conference on Robotics and Automation.
[12] Brian Mirtich,et al. V-Clip: fast and robust polyhedral collision detection , 1998, TOGS.
[13] Leonidas J. Guibas,et al. Separation-sensitive collision detection for convex objects , 1998, SODA '99.
[14] Leonidas J. Guibas,et al. Separation-sensitive convex collision detection , 1999 .