Video
Loading video...

📄 Journal Article

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

December 01, 1997 113 citations 🔓 Bronze Discrete & Computational Geometry
113
Citations
2
Authors
22
References
2
Countries
Authors (2) 1 from IIT Delhi
Publication Details
TypeJournal Article
PublishedDecember 01, 1997
Source Discrete & Computational Geometry
PublisherSpringer Science+Business Media
Volume/Issue Vol. 18 , Issue 4 , pp. 377-383
DOI 10.1007/pl00009323
OpenAlex ID W2029668981
Open Accessbronze Access Free PDF