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

DOI10.1142/S0218195998000102zbMath1035.68534MaRDI QIDQ4513205

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

Publication date: 7 November 2000

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

zbMATH Keywords

linear programmingassembly planning

Mathematics Subject Classification ID

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

Related Items (1)

Detecting geometric infeasibility

Uses Software

• MINOS

Cites Work

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

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