A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract) - researchr publication

researchr

You are not signed in
Sign in
Sign up

Jean-Daniel Boissonnat, Sylvain Lazard. A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract). In Symposium on Computational Geometry. pages 242-251, 1996. [doi]

Abstract is missing.

runs on WebDSL