A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles

MLA

Sylvain Lazard, and Jean-Daniel Boissonnat. A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature amidst Moderate Obstacles. Jan. 2003. EBSCOhost, https://doi.org/10.1142/S0218195903001128⟩.

APA

Sylvain Lazard, & Jean-Daniel Boissonnat. (2003). A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles. https://doi.org/10.1142/S0218195903001128⟩

Chicago

Sylvain Lazard, and Jean-Daniel Boissonnat. 2003. “A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature amidst Moderate Obstacles,” January. doi:10.1142/S0218195903001128⟩.