Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Computational complexity of motion and stability of polygons
Computational complexity of motion and stability of polygons
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Objects that cannot be taken apart with two hands
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
On the complexity of assembly partitioning
Information Processing Letters
Partitioning a planar assembly into two connected parts is NP-complete
Information Processing Letters
Two-handed assembly sequencing
International Journal of Robotics Research
Complexity measures for assembly sequences
Complexity measures for assembly sequences
Detecting geometric infeasibility
Artificial Intelligence
Efficient generation of k-directional assembly sequences
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the automatic generation of plans for mechanical assembly
On the automatic generation of plans for mechanical assembly
| Hi-index | 0.89 |
The problem of deciding whether 2- or 3-dimensional objects can be separated by a sequence of arbitrary translational motions is known to have exponential lower bounds. However, under certain restrictions on the type of motions, polynomial time bounds have been shown. An example is finding a subset of the parts that is removable by a single translation. In this case, the main restriction is that all selected parts are required to be removed in the same direction and with the same velocity. It was an open question whether the polynomial time bound can be achieved if more than a single velocity is allowed for the moving parts. In this paper, we answer this question by proving that such 'multi-handed' separability problems are NP-hard.