Scholars@Duke
Journal cover image

The complexity of the two dimensional curvature-constrained shortest-path problem

Publication ,  Conference
Reif, J; Wang, H
Published in: ROBOTICS: THE ALGORITHMIC PERSPECTIVE
1998

Duke Scholars

John H. Reif
Author John H. Reif Computer Science

Published In

ROBOTICS: THE ALGORITHMIC PERSPECTIVE

ISBN

1-56881-081-4

Publication Date

1998

Start / End Page

49 / 57
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Reif, J., & Wang, H. (1998). The complexity of the two dimensional curvature-constrained shortest-path problem. In ROBOTICS: THE ALGORITHMIC PERSPECTIVE (pp. 49–57).
Reif, J., and H. Wang. “The complexity of the two dimensional curvature-constrained shortest-path problem.” In ROBOTICS: THE ALGORITHMIC PERSPECTIVE, 49–57, 1998.
Reif J, Wang H. The complexity of the two dimensional curvature-constrained shortest-path problem. In: ROBOTICS: THE ALGORITHMIC PERSPECTIVE. 1998. p. 49–57.
Reif, J., and H. Wang. “The complexity of the two dimensional curvature-constrained shortest-path problem.” ROBOTICS: THE ALGORITHMIC PERSPECTIVE, 1998, pp. 49–57.
Reif J, Wang H. The complexity of the two dimensional curvature-constrained shortest-path problem. ROBOTICS: THE ALGORITHMIC PERSPECTIVE. 1998. p. 49–57.
Journal cover image

Published In

ROBOTICS: THE ALGORITHMIC PERSPECTIVE

ISBN

1-56881-081-4

Publication Date

1998

Start / End Page

49 / 57