An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane

Publisher Website

1 December 1997

journal article
research article
Published by Springer Nature in Discrete & Computational Geometry

Vol. 18 (4), 377-383
https://doi.org/10.1007/pl00009323

Abstract

No abstract available

Keywords

Cited by 71 articles