Efficient generation of k-directional assembly sequences
暂无分享,去创建一个
Micha Sharir | Mark de Berg | Pankaj K. Agarwal | Dan Halperin | M. Sharir | P. Agarwal | D. Halperin | M. D. Berg
[1] Godfried T. Toussaint,et al. Movable Separability of Sets , 1985 .
[2] Sukhan Lee,et al. Computer-Aided Mechanical Assembly Planning , 1991 .
[3] Randall H. Wilson,et al. On geometric assembly planning , 1992 .
[4] Mark de Berg,et al. Computing and verifying depth orders , 1992, SCG '92.
[5] Randall H. Wilson,et al. Partitioning An Assembly For Infinitesimal Motions In Translation And Rotation , 1992, Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems.
[6] Jirí Matousek,et al. Ray shooting and parametric search , 1992, STOC '92.
[7] Mark de Berg,et al. Ray Shooting, Depth Orders and Hidden Surface Removal , 1993, Lecture Notes in Computer Science.
[8] Jesús García-López,et al. Circular Visibility and Separability , 1993, CCCG.
[9] Jean-Claude Latombe,et al. Geometric Reasoning About Mechanical Assembly , 1994, Artif. Intell..
[10] Micha Sharir,et al. Computing Depth Orders and Related Problems , 1994, SWAT.
[11] MatoušekJiří. Geometric range searching , 1994 .
[12] Leonidas J. Guibas,et al. A simple and efficient procedure for polyhedral assembly partitioning under infinitesimal motions , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.
[13] Elmar Schömer,et al. Efficient collision detection for moving polyhedra , 1995, SCG '95.
[14] Christian Thiely. Eecient Collision Detection for Moving Polyhedra , 1995 .