A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles (extended abstract)

  • Authors:
  • Jean-Daniel Boissonnat;Sylvain Lazard

  • Affiliations:
  • INRIA, BP 93, 06902 Sophia Antipolis Cedex, France;INRIA, BP 93, 06902 Sophia Antipolis Cedex, France

  • Venue:
  • Proceedings of the twelfth annual symposium on Computational geometry
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract