AN EFFICIENT SYSTEM FOR GEOMETRIC ASSEMBLY SEQUENCE GENERATION AND EVALUATION
暂无分享,去创建一个
Michael H. Goldwasser | Bruce Romney | Cyprien Godard | G. Ramkumar | G. Ramkumar | B. Romney | Cyprien Godard
[1] Jan D. Wolter. On the automatic generation of assembly plans , 1989, Proceedings, 1989 International Conference on Robotics and Automation.
[2] Micha Sharir,et al. Separating two simple polygons by a sequence of translations , 2015, Discret. Comput. Geom..
[3] Sukhan Lee,et al. Assembly planning based on geometric reasoning , 1990, Comput. Graph..
[4] Lydia E. Kavraki,et al. On the Complexity of Assembly Partitioning , 1993, CCCG.
[5] Richard Hoffman. A common sense approach to assembly sequence planning , 1991 .
[6] Tien-Chien Chang,et al. 3D MAPS: Three-dimensional mechanical assembly planning system , 1993 .
[7] Thomas L. DeFazio,et al. Simplified generation of all mechanical assembly sequences , 1987, IEEE Journal on Robotics and Automation.
[8] P. Dewhurst,et al. Automatic Generation of Product Disassembly Sequences , 1991 .
[9] Randall H. Wilson,et al. On geometric assembly planning , 1992 .
[10] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .
[11] D. Dutta,et al. Automatic Disassembly and Total Ordering in Three Dimensions , 1991 .
[12] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[13] Michael H. Goldwasser,et al. An Implementation for Mainta Ining Arrangements of Polygons , 1995 .
[14] Lydia E. Kavraki,et al. Two-Handed Assembly Sequencing , 1995, Int. J. Robotics Res..
[15] R. Hoffman. Automated assembly planning for B-rep products , 1990, 1990 IEEE International Conference on Systems Engineering.
[16] Michael H. Goldwasser. An implementation for maintaining arrangements of polygons , 1995, SCG '95.
[17] 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.
[18] Ketan Mulmuley,et al. Computational geometry : an introduction through randomized algorithms , 1993 .
[19] Lydia E. Kavraki,et al. Partitioning a Planar Assembly Into Two Connected Parts is NP-Complete , 1995, Inf. Process. Lett..
[20] Richard A. Volz,et al. On the automatic generation of plans for mechanical assembly , 1988 .
[21] Bernard Chazelle,et al. Triangulation and shape-complexity , 1984, TOGS.
[22] Arthur C. Sanderson,et al. AND/OR graph representation of assembly plans , 1986, IEEE Trans. Robotics Autom..
[23] Jean-Claude Latombe,et al. Assembly sequencing with toleranced parts , 1995 .
[24] Raimund Seidel,et al. A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons , 1991, Comput. Geom..
[25] Arthur C. Sanderson,et al. A correct and complete algorithm for the generation of mechanical assembly sequences , 1991, IEEE Trans. Robotics Autom..
[26] Joseph M. Miller,et al. Automatic assembly planning with fasteners , 1989, Proceedings, 1989 International Conference on Robotics and Automation.
[27] Arthur C. Sanderson,et al. Automatic Generation of Mechanical Assembly Sequences , 1988 .