Pulse nav.journalClub トレンド探索質問研究者

Download the App

Join discussions, follow papers, and never miss your next session.

© Synapse Social LLC, 2026プライバシーポリシー

ホーム探索 nav.journalClub トレンド

⌘+K

October 1, 1979

Complexity of the mover's problem and generalizations

Key Points

Key points are not available for this paper at this time.

Abstract

This paper concerns the problem of moving a polyhedron through Euclidean space while avoiding polyhedral obstacles.

Like

Bookmark

Share

Cite This Study

John H. Reif (Mon,) studied this question.

synapsesocial.com/papers/69fbee315f7b57d3e8b86a8d https://doi.org/https://doi.org/10.1109/sfcs.1979.10

Like

Bookmark

Share

Complexity of the mover's problem and generalizations | Synapse

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Robots, Models, and Automation1979 · 13 citations
2Robot-manipulator control algorithms1979 · 17 citations
3A Mobile Automaton: An Application of Artificial Intelligence Techniques1969 · 542 citations
4Relationships between nondeterministic and deterministic tape complexities1970 · 1,362 citations
5Finding the Intersection of a Set of n Half-Spaces in Time O(nlogn).1977 · 5 citations