Assembly sequences for polyhedra

DOI10.1007/BF01189068zbMath0826.68128OpenAlexW1993028096MaRDI QIDQ1892580

Yanyan Li

Publication date: 19 June 1995

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01189068

zbMATH Keywords

assembly planning

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (2)

Detecting geometric infeasibility ⋮ On the complexity of one-shot translational separability.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The power of geometric duality
• Separating two simple polygons by a sequence of translations
• Objects that cannot be taken apart with two hands
• On separating two simple polygons by a single translation
• On Removing a Ball without Disturbing the Others
• Spatial Planning: A Configuration Space Approach

This page was built for publication: Assembly sequences for polyhedra