Detecting geometric infeasibility

DOI10.1016/S0004-3702(98)00076-9MaRDI QIDQ1274558zbMATH OpenFDO

Authors Achim Schweikard, Fabian Schwarzer

Publication date 12 January 1999

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0004-3702(98)00076-9

zbMATH Keywords

arrangement computation in \(D\) dimensionsassembly planningcomplete algorithmsgeometric reasoningmotion planning

Mathematics Subject Classification ID

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

Recommendations

• The geometry of linear infeasibility
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Geometry and impossibility
• Geometric possibility
• Geometric possibility
• Geometric and topological inference
• Rethinking geometrical exactness
• Nonrealizability proofs in computational geometry
• Geometric Model Checking of Continuous Space

Cites work

• Assembly sequences for polyhedra
• COMPUTATIONAL GEOMETRY COLUMN 22
• scientific article; zbMATH DE number 3883607 (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 734886 (Why is no real title available?)
• scientific article; zbMATH DE number 871907 (Why is no real title available?)
• Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
• Separating two simple polygons by a sequence of translations
• Spatial Planning: A Configuration Space Approach

Cited in

(5)

• Geometric reasoning about assembly tools
• On the complexity of one-shot translational separability.
• Assembly planning by disjunctive programming and geometrical reasoning
• 3D geometric constraint analysis and its application on the spatial assembly sequence planning
• Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes

Describes a project that uses

Uses Software

• LEDA

This page was built for publication: Detecting geometric infeasibility

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