Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes

DOI10.1142/S0218195998000102zbMATH Open1035.68534MaRDI QIDQ4513205FDOQ4513205

Authors: Hirohisa Hirukawa, Jean-Claude Latombe, Randall H. Wilson, Leonidas Guibas, Dan Halperin 

Publication date: 7 November 2000

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Recommendations

• Assembly sequences for polyhedra
• Detecting geometric infeasibility
• Polyhedral assembly partitioning with infinite translations or the importance of being exact
• A general framework for assembly planning: The motion space approach
• On the complexity of assembly partitioning

zbMATH Keywords

linear programmingassembly planning

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Kinematics of mechanisms and robots (70B15) Computational aspects related to convexity (52B55)

Cites Work

• Linear Programming in Linear Time When the Dimension Is Fixed
• On the general motion-planning problem with two degrees of freedom
• On the Zone Theorem for Hyperplane Arrangements
• Almost tight upper bounds for the single cell and zone problems in the three dimensions
• Objects that cannot be taken apart with two hands
• On Removing a Ball without Disturbing the Others

Cited In (4)

• Objects that cannot be taken apart with two hands
• Polyhedral assembly partitioning with infinite translations or the importance of being exact
• Detecting geometric infeasibility
• Assembly sequences for polyhedra

Uses Software

• MINOS

This page was built for publication: Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes

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