Partitioning a Planar Assembly Into Two Connected Parts is NP-Complete
暂无分享,去创建一个
[1] Esther M. Arkin,et al. On monotone paths among obstacles with applications to planning assemblies , 1989, SCG '89.
[2] 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.
[3] Jorge Stolfi,et al. Objects that cannot be taken apart with two hands , 1993, SCG '93.
[4] Godfried T. Toussaint,et al. Movable Separability of Sets , 1985 .
[5] Jörg-Rüdiger Sack,et al. Disassembling two-dimensional composite parts via translations , 1993, Int. J. Comput. Geom. Appl..
[6] Lydia E. Kavraki,et al. Two-Handed Assembly Sequencing , 1995, Int. J. Robotics Res..
[7] Tomas Lozano-Perez,et al. On the Complexity of Partitioning an Assembly. , 1992 .
[8] Randall H. Wilson,et al. On geometric assembly planning , 1992 .
[9] Jörg-Rüdiger Sack,et al. Disassembling Two-Dimensional Composite Parts via Translations , 1989, Optimal Algorithms.
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] Sukhan Lee,et al. Computer-Aided Mechanical Assembly Planning , 1991 .
[12] Balas K. Natarajan,et al. On planning assemblies , 1988, SCG '88.
[13] Leonidas J. Guibas,et al. On translating a set of rectangles , 1980, STOC '80.
[14] Lydia E. Kavraki,et al. On the Complexity of Assembly Partitioning , 1993, CCCG.
[15] J. Latombe,et al. A Simple and E cient Procedure for Polyhedral Assembly Partitioning under In nitesimal Motions , 1995 .
[16] J. Schwartz,et al. On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .