Assembly sequences for polyhedra

DOI10.1007/BF01189068MaRDI QIDQ1892580zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
• scientific article; zbMATH DE number 871907
• A general framework for assembly planning: The motion space approach
• Polyhedral assembly partitioning with infinite translations or the importance of being exact
• DISASSEMBLING TWO-DIMENSIONAL COMPOSITE PARTS VIA TRANSLATIONS

Cites work

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 3945379 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• Objects that cannot be taken apart with two hands
• On Removing a Ball without Disturbing the Others
• On separating two simple polygons by a single translation
• Separating two simple polygons by a sequence of translations
• Spatial Planning: A Configuration Space Approach
• The power of geometric duality

Cited in

(9)

• On the complexity of one-shot translational separability.
• Intractability of assembly sequencing: unit disks in the plane
• scientific article; zbMATH DE number 4155942 (Why is no real title available?)
• Polyhedral assembly partitioning with infinite translations or the importance of being exact
• Detecting geometric infeasibility
• scientific article; zbMATH DE number 797431 (Why is no real title available?)
• scientific article; zbMATH DE number 4041266 (Why is no real title available?)
• Minimal fixturing of frictionless assemblies: Complexity and algorithms
• Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes

This page was built for publication: Assembly sequences for polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892580)