COMPLEXITY OF THE MOVER'S PROBLEM AND GENERALIZATIONS.
Publication
, Journal Article
Reif, JH
Published in: Annual Symposium on Foundations of Computer Science Proceedings
January 1, 1979
The problem of moving a polyhedron through Euclidean space while avoiding polyhedral obstacles is considered. This work was motivated by problems in robotics.
Duke Scholars
Published In
Annual Symposium on Foundations of Computer Science Proceedings
ISSN
0272-5428
Publication Date
January 1, 1979
Start / End Page
421 / 427
Citation
APA
Chicago
ICMJE
MLA
NLM
Reif, J. H. (1979). COMPLEXITY OF THE MOVER'S PROBLEM AND GENERALIZATIONS. Annual Symposium on Foundations of Computer Science Proceedings, 421–427.
Reif, J. H. “COMPLEXITY OF THE MOVER'S PROBLEM AND GENERALIZATIONS.” Annual Symposium on Foundations of Computer Science Proceedings, January 1, 1979, 421–27.
Reif JH. COMPLEXITY OF THE MOVER'S PROBLEM AND GENERALIZATIONS. Annual Symposium on Foundations of Computer Science Proceedings. 1979 Jan 1;421–7.
Reif, J. H. “COMPLEXITY OF THE MOVER'S PROBLEM AND GENERALIZATIONS.” Annual Symposium on Foundations of Computer Science Proceedings, Jan. 1979, pp. 421–27.
Reif JH. COMPLEXITY OF THE MOVER'S PROBLEM AND GENERALIZATIONS. Annual Symposium on Foundations of Computer Science Proceedings. 1979 Jan 1;421–427.
Published In
Annual Symposium on Foundations of Computer Science Proceedings
ISSN
0272-5428
Publication Date
January 1, 1979
Start / End Page
421 / 427