On the complexity of one-shot translational separability.

DOI10.1016/S0020-0190(01)00333-7zbMath1043.68065MaRDI QIDQ1853067

Achim Schweikard, Fabian Schwarzer

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Computational geometryComputational complexityMotion planningAssembly planning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning a planar assembly into two connected parts is NP-complete
• Detecting geometric infeasibility
• On the complexity of assembly partitioning
• Objects that cannot be taken apart with two hands
• Assembly sequences for polyhedra
• On Removing a Ball without Disturbing the Others