Partitioning a planar assembly into two connected parts is NP-complete
- 1 August 1995
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 55 (3) , 159-165
- https://doi.org/10.1016/0020-0190(95)00083-o
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- On the complexity of assembly partitioningInformation Processing Letters, 1993
- DISASSEMBLING TWO-DIMENSIONAL COMPOSITE PARTS VIA TRANSLATIONSInternational Journal of Computational Geometry & Applications, 1993
- On the Complexity of Partitioning an Assembly.Published by Defense Technical Information Center (DTIC) ,1992
- Separating two simple polygons by a sequence of translationsDiscrete & Computational Geometry, 1988
- On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriersCommunications on Pure and Applied Mathematics, 1983