Fast distance queries with rectangular swept sphere volumes
暂无分享,去创建一个
Dinesh Manocha | Ming C. Lin | Stefan Gottschalk | Eric Larsen | D. Manocha | Stefan Gottschalk | E. Larsen | Dinesh Manocha | M. Lin | S. Gottschalk
[1] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.
[2] David G. Kirkpatrick,et al. Fast Detection of Polyhedral Intersections , 1982, ICALP.
[3] David G. Kirkpatrick,et al. Fast Detection of Polyhedral Intersection , 1983, Theor. Comput. Sci..
[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] Bernard Chazelle. An optimal algorithm for intersecting three-dimensional convex polyhedra , 1989, 30th Annual Symposium on Foundations of Computer Science.
[6] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[7] David Baraff,et al. Curved surfaces and coherence for non-penetrating rigid body simulation , 1990, SIGGRAPH.
[8] Raimund Seidel,et al. Linear programming and convex hulls made easy , 1990, SCG '90.
[9] Ming C. Lin,et al. A fast algorithm for incremental distance calculation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.
[10] Stephen Cameron,et al. Approximation hierarchies and S-bounds , 1991, SMA '91.
[11] Philip M. Hubbard,et al. Interactive collision detection , 1993, Proceedings of 1993 IEEE Research Properties in Virtual Reality Symposium.
[12] Sean Quinlan,et al. Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.
[13] Dinesh Manocha,et al. I-COLLIDE: an interactive and exact collision detection system for large-scale environments , 1995, I3D '95.
[14] Martin Held,et al. Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs , 1995 .
[15] Dinesh Manocha,et al. OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.
[16] Joseph S. B. Mitchell,et al. Real-time collision detection for motion simulation within complex environments , 1996, SIGGRAPH '96.
[17] Leonidas J. Guibas,et al. BOXTREE: A Hierarchical Representation for Surfaces in 3D , 1996, Comput. Graph. Forum.
[18] Stephen Cameron,et al. Enhancing GJK: computing minimum and penetration distances between convex polyhedra , 1997, Proceedings of International Conference on Robotics and Automation.
[19] Lydia E. Kavraki,et al. On finding narrow passages with probabilistic roadmap planners , 1998 .
[20] Dinesh Manocha,et al. Spherical shell: a higher order bounding volume for fast proximity queries , 1998 .
[21] Elaine Cohen,et al. A framework for efficient minimum distance computations , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).
[22] Brian Mirtich,et al. V-Clip: fast and robust polyhedral collision detection , 1998, TOGS.
[23] Joseph S. B. Mitchell,et al. Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..
[24] Dinesh Manocha,et al. Randomized Path Planning for a Rigid Body Based on Hardware Accelerated Voronoi Sampling , 1999 .
[25] Dinesh Manocha,et al. Fast Proximity Queries with Swept Sphere Volumes , 1999 .
[26] Ming C. Lin,et al. A framework for fast and accurate collision detection for haptic interaction , 1998, Proceedings IEEE Virtual Reality (Cat. No. 99CB36316).
[27] Gregory,et al. EFFICIENT DISTANCE CALCULATION USING THE SPHERICALLY-EXTENDED POLYTOPE ( STOPE ) MODEL Y / w-/ s a 3 by , .