{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,15]],"date-time":"2026-11-15T03:35:21Z","timestamp":1794713721106,"version":"4.9.1"},"reference-count":24,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1999,1]]},"abstract":"<jats:p>We propose an optimal-time algorithm for a classical problem in plane computational geometry: computing a shortest path between two points in the presence of polygonal obstacles. Our algorithm runs in worst-case time O(n log n) and requires O(n log n) space, where n is the total number of vertices in the obstacle polygons. The algorithm is based on an efficient implementation of wavefront propagation among polygonal obstacles, and it actually computes a planar map encoding shortest paths from a fixed source point to all other points of the plane; the map can be used to answer single-source shortest path queries in O(log n) time. The time complexity of our algorithm is a significant improvement over all previously published results on the shortest path problem. Finally, we also discuss extensions to more general shortest path problems, involving nonpoint and multiple sources.<\/jats:p>","DOI":"10.1137\/s0097539795289604","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"2215-2256","source":"Crossref","is-referenced-by-count":206,"title":["An Optimal Algorithm for Euclidean Shortest Paths in the Plane"],"prefix":"10.1137","volume":"28","author":[{"given":"John","family":"Hershberger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Subhash","family":"Suri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,28]]},"reference":[{"key":"R1","first-page":"557","volume":"68","author":"Asano T.","year":"1985","journal-title":"Trans. IECE Japan"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840436"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"Marshall Bern, David Eppstein, John Gilbert, Provably good mesh generation, IEEE Comput. Soc. Press, Los Alamitos, CA, 1990, 231\u201324192k:65132","DOI":"10.1109\/FSCS.1990.89542"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Bernard Chazelle, A theorem on polygon cutting with applications, IEEE, New York, 1982, 339\u2013349780415","DOI":"10.1109\/SFCS.1982.58"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90044-5"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"L. P. Chew and R. L. Drysdale,\n                      Voronoi diagrams based on convex distance functions\n                      , in Proceedings of the ACM Symposium on Computational Geometry, Baltimore, MD, 1985, pp. 235\u2013244.","DOI":"10.1145\/323233.323264"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"K. L. Clarkson,\n                      Approximation algorithms for shortest path motion planning\n                      , in Proceedings of the 19th ACM Symposium on Theory of Computing, New York, NY, 1987, pp. 56\u201365.","DOI":"10.1145\/28395.28402"},{"key":"R8","volume-title":"Introduction to algorithms","author":"Manber Udi","year":"1989"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/0215023"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/0220055"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840360"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(94)90010-8"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"S. Kapoor and S. N. Maheshwari,\n                      Efficient algorithms for Euclidean shortest paths and visibility problems with polygonal obstacles\n                      , in Proceedings of the 4th ACM Symposium on Computational Geometry, Urbana\u2010Champaign, IL, 1988, pp. 172\u2013182.","DOI":"10.1145\/73393.73411"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1137\/0212002"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140304"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530888"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195996000216"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1137\/0216045"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"M. H. Overmars and E. Welzl,\n                      New methods for computing visibility graphs\n                      , in Proceedings of the 4th ACM Symposium on Computational Geometry, Urbana\u2010Champaign, IL, 1988, pp. 164\u2013171.","DOI":"10.1145\/73393.73410"},{"key":"R22","doi-asserted-by":"crossref","unstructured":"F. P. Preparata and M. I. Shamos,\n                      Computational Geometry\n                      , Springer\u2010Verlag, New York, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1145\/185675.185795"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90045-1"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0097539795289604","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:12:42Z","timestamp":1787335962000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0097539795289604"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["10.1137\/S0097539795289604"],"URL":"https:\/\/doi.org\/10.1137\/s0097539795289604","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}