zbMATH — the first resource for mathematics

On the complexity of assembly partitioning. (English) Zbl 0787.68050
Summary: We study the complexity of the assembly partioning problem in the plane: given a collection of non-overlapping polygons, decide if there is a proper subcollection of them that can be removed as a rigid body without colliding with or disturbing the other parts of the assembly. It is shown that assembly partitioning is NP-complete. The result extends to several interesting variants of the problem.

68Q25 Analysis of algorithms and problem complexity
68U05 Computer graphics; computational geometry (digital and algorithmic aspects)
Full Text: DOI
[1] Arkin, E.M.; Connelly, R.; Mitchell, J.S.B., On monotone paths among obstacles with applications to planning assemblies, Proc. 5th ACM symp. on computational geometry, 334-343, (1989)
[2] Garey, M.R.; Johnson, D.S., Computers and intractability, A guide to the theory of NP-completeness, (1979), Freeman New York · Zbl 0411.68039
[3] Guibas, L.; Yao, F., On translating a set of rectangles, (), 61-67, Advances in Computing Research
[4] Halberstam, H.; Roth, K.F., Sequences, (1983), Springer New York · Zbl 0498.10001
[5] de Mello, L.S.Homem; Lee, S., Computer-aided mechanical assembly planning, (1991), Kluwer Academic Publishers Boston, MA
[6] Kavraki, L.; Latombe, J.-C., Complexity of partitioning a planar assembly, Tech. rept. STAN-CS-93-1467, (1993), Dept. of Computer Science, Stanford University
[7] Natarajan, B.K., On planning assemblies, Proc. 4th ACM symp. on computational geometry, 299-308, (1988)
[8] Nussbaum, D.; Sack, J.R., Dissasembling two-dimensional composite parts via translations, Internat. J. comput. geom., 3, 71-84, (1993) · Zbl 0777.68081
[9] Pollack, R.; Sharir, M.; Sifrony, S., Separating two polygons by a sequence of translations, Discrete comput. geom., 3, 123-136, (1988) · Zbl 0646.68052
[10] Schwartz, J.T.; Sharir, M., On the piano movers’ problem: I. the case of a two-dimensional rigid polygonal body moving amidst polygonal barriers, Comm. pure appl. math., 36, 345-398, (1983) · Zbl 0554.51007
[11] Snoeyink, J.; Stolfi, J., Objects that cannot be taken apart with two hands, Proc. 9th ACM symp. on computational geometry, 247-256, (1993) · Zbl 0813.52004
[12] Toussaint, G.T., Movable separability of sets, Computational geometry, (1985), North-Holland Amsterdam · Zbl 0588.68053
[13] Wilson, R.H., On geometric assembly planning, Ph.D. thesis, (March 1992), Stanford University, Tech. Rept. STAN-CS-92-1416
[14] Wilson, R.H.; Latombe, J.C.; Lozano-Pérez, T., On the complexity of partitioning an assembly, Tech. rept. STAN-CS-92-1458, (1992), Dept. of Computer Science, Stanford University
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.