Collision prediction for polyhedra under screw motions
暂无分享,去创建一个
[1] Narendra Ahuja,et al. Interference Detection and Collision Avoidance Among Three Dimensional Objects , 1980, AAAI.
[2] John W. Boyse,et al. Interference detection among solids and surfaces , 1979, CACM.
[3] Carme Torras,et al. 3D collision detection: a survey , 2001, Comput. Graph..
[4] Stephen Cameron,et al. Enhancing GJK: computing minimum and penetration distances between convex polyhedra , 1997, Proceedings of International Conference on Robotics and Automation.
[5] Carme Torras,et al. Collision Detection : A Geometric Approach , 1994, Modelling and Planning for Sensor Based Intelligent Robot Systems.
[6] Angel P. del Pobil,et al. Very fast collision detection for practical motion planning. I. The spatial representation , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).
[7] Gino van den Bergen. A Fast and Robust GJK Implementation for Collision Detection of Convex Objects , 1999, J. Graphics, GPU, & Game Tools.
[8] James E. Bobrow,et al. A Direct Minimization Approach for Obtaining the Distance between Convex Polyhedra , 1989, Int. J. Robotics Res..
[9] Dinesh Manocha,et al. V-COLLIDE: accelerated collision detection for VRML , 1997, VRML '97.
[10] James U. Korein,et al. A geometric investigation of reach , 1985 .
[11] Dinesh Manocha,et al. OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.
[12] Philip M. Hubbard,et al. Interactive collision detection , 1993, Proceedings of 1993 IEEE Research Properties in Virtual Reality Symposium.
[13] Vincent Hayward,et al. Fast collision detection scheme by recursive decomposition of a manipulator workspace , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[14] Yutaka Hori,et al. Octree-based approach to real-time collision-free path planning for robot manipulator , 1996, Proceedings of 4th IEEE International Workshop on Advanced Motion Control - AMC '96 - MIE.
[15] John F. Canny,et al. Collision Detection for Moving Polyhedra , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[16] Jarek Rossignac,et al. Computing and visualizing pose-interpolating 3D motions , 2001, Comput. Aided Des..
[17] R. Kelley,et al. A representation scheme for rapid 3D collision detection , 1988, Proceedings IEEE International Symposium on Intelligent Control 1988.
[18] Stephen Cameron,et al. A comparison of two fast algorithms for computing the distance between convex polyhedra , 1997, IEEE Trans. Robotics Autom..
[19] Stephen P. Boyd,et al. Obstacle Collision Detection Using Best Ellipsoid Fit , 1997, J. Intell. Robotic Syst..
[20] Stephen Cameron,et al. Collision detection by four-dimensional intersection testing , 1990, IEEE Trans. Robotics Autom..
[21] Dinesh Manocha,et al. I-COLLIDE: an interactive and exact collision detection system for large-scale environments , 1995, I3D '95.
[22] Daniel Thalmann,et al. An adaptive spatial sub-division of the object space for fast collision of ani-mated rigid bodies , 1995 .
[23] Daniel Thalmann,et al. An Adaptive Spatial Subdivision of the Object Space for Fast Collision Detection of Animated Rigid Bodies , 1995, Comput. Graph. Forum.
[24] Vijay Kumar,et al. Interpolation schemes for rigid body motions , 1998, Comput. Aided Des..
[25] Bernard Chazelle,et al. Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm , 1984, SIAM J. Comput..
[26] Elmer G. Gilbert,et al. Computing the distance between general convex objects in three-dimensional space , 1990, IEEE Trans. Robotics Autom..
[27] David G. Kirkpatrick,et al. Determining the Separation of Preprocessed Polyhedra - A Unified Approach , 1990, ICALP.
[28] George Vanĕček,et al. Collision Detection and Analysis in a Physically Based Simulation , 1991 .
[29] John M. Snyder,et al. Interval methods for multi-point collisions between time-dependent curved surfaces , 1993, SIGGRAPH.
[30] Philip M. Hubbard,et al. Approximating polyhedra with spheres for time-critical collision detection , 1996, TOGS.
[31] Alan H. Barr,et al. Geometric collisions for time-dependent parametric surfaces , 1990, SIGGRAPH.
[32] Bernard Chazelle,et al. Strategies for polyhedral surface decomposition: an experimental study , 1995, SCG '95.
[33] Elmar Schömer,et al. Efficient collision detection for moving polyhedra , 1995, SCG '95.
[34] Stephen Cameron,et al. A study of the clash detection problem in robotics , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.
[35] Chandrajit L. Bajaj,et al. Convex Decomposition of Polyhedra and Robustness , 1992, SIAM J. Comput..
[36] Angel P. del Pobil,et al. A new representation for collision avoidance and detection , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.
[37] Karl G. Kempf,et al. A collision detection algorithm based on velocity and distance bounds , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[38] Ming C. Lin,et al. Collision Detection between Geometric Models: A Survey , 1998 .
[39] Ming C. Lin,et al. A fast algorithm for incremental distance calculation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.
[40] K. K. Wang,et al. Geometric Modeling for Swept Volume of Moving Solids , 1986, IEEE Computer Graphics and Applications.
[41] Richard L. Grimsdale,et al. Collision Detection for Animation using Sphere‐Trees , 1995, Comput. Graph. Forum.
[42] Sean Quinlan,et al. Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.
[43] S. A. Cameron,et al. Determining the minimum translational distance between two convex polyhedra , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[44] Bernard Roth,et al. An Extension of Screw Theory , 1981 .
[45] Joseph S. B. Mitchell,et al. Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..
[46] S. Sathiya Keerthi,et al. A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..
[47] John Canny,et al. The complexity of robot motion planning , 1988 .