On the Complexity of Assembly Partitioning (1993)
by
Lydia Kavraki
,
Jean-claude Latombe
,
Randall H. Wilson
| Venue: | Information Processing Letters |
| Citations: | 13 - 3 self |
BibTeX
@ARTICLE{Kavraki93onthe,
author = {Lydia Kavraki and Jean-claude Latombe and Randall H. Wilson},
title = {On the Complexity of Assembly Partitioning},
journal = {Information Processing Letters},
year = {1993},
volume = {48},
pages = {229--235}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper studies the complexity of the assembly partitioning 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.
