Detecting geometric infeasibility

DOI10.1016/S0004-3702(98)00076-9zbMath0909.68178MaRDI QIDQ1274558

Fabian Schwarzer, Achim Schweikard

Publication date: 12 January 1999

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

geometric reasoningmotion planningarrangement computation in \(D\) dimensionsassembly planningcomplete algorithms

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

On the complexity of one-shot translational separability.

Uses Software

• LEDA

Cites Work

• Separating two simple polygons by a sequence of translations
• Assembly sequences for polyhedra
• Spatial Planning: A Configuration Space Approach
• COMPUTATIONAL GEOMETRY COLUMN 22
• Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Detecting geometric infeasibility