Complexity of the mover's problem and generalizations

  • Authors:
  • John H. Reif

  • Affiliations:
  • -

  • Venue:
  • SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
  • Year:
  • 1979

Quantified Score

Hi-index 0.00

Visualization

Abstract

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