On the complexity of assembly partitioning

DOI10.1016/0020-0190(93)90085-NzbMath0787.68050OpenAlexW2030883916MaRDI QIDQ1313730

Jean-Claude Latombe, Randall H. Wilson, Lydia E. Kavraki

Publication date: 1993

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

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90085-n

zbMATH Keywords

computational complexitymotion planningcomputational geometryassembly planningassembly partioning

Mathematics Subject Classification ID

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

Related Items (2)

Partitioning a planar assembly into two connected parts is NP-complete ⋮ On the complexity of one-shot translational separability.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Separating two simple polygons by a sequence of translations
• Objects that cannot be taken apart with two hands
• On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
• DISASSEMBLING TWO-DIMENSIONAL COMPOSITE PARTS VIA TRANSLATIONS

This page was built for publication: On the complexity of assembly partitioning