{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:40:05Z","timestamp":1750200005672,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2005323"],"award-info":[{"award-number":["CCF-2005323"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451037","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"975-988","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A new algorithm for Euclidean shortest paths in the plane"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8134-7409","authenticated-orcid":false,"given":"Haitao","family":"Wang","sequence":"first","affiliation":[{"name":"Utah State University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.04.023"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195994000252"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/110840030"},{"key":"e_1_3_2_1_4_1","first-page":"2016","article-title":"Two-point L_1 shortest path queries in the plane","volume":"1","author":"Chen D.Z.","year":"2016","unstructured":"D.Z. Chen, R. Inkulu, and H. Wang. 2016. Two-point L_1 shortest path queries in the plane. Journal of Computational Geometry, 1, 2016. Pages 473\u2013519.","journal-title":"Journal of Computational Geometry"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796307194"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660771"},{"key":"e_1_3_2_1_7_1","first-page":"2015","article-title":"A new algorithm for computing visibility graphs of polygonal obstacles in the plane","volume":"6","author":"Chen D.Z.","year":"2015","unstructured":"D.Z. Chen and H. Wang. 2015. A new algorithm for computing visibility graphs of polygonal obstacles in the plane. Journal of Computational Geometry, 6, 2015. Pages 316\u2013345.","journal-title":"Journal of Computational Geometry"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0058-y"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-00540-x"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Pages 215\u2013224","author":"Chiang Y.-J.","year":"1999","unstructured":"Y.-J. Chiang and J.S.B. Mitchell. 1999. Two-point Euclidean shortest path queries in the plane. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Pages 215\u2013224."},{"key":"e_1_3_2_1_11_1","first-page":"1992","article-title":"Randomized parallel algorithms for trapezoidal diagrams","volume":"2","author":"Clarkson K.L.","year":"1992","unstructured":"K.L. Clarkson, R. Cole, and R.E. Tarjan. 1992. Randomized parallel algorithms for trapezoidal diagrams. International Journal of Computational Geometry and Application, 2, 1992. Pages 117\u2013133.","journal-title":"International Journal of Computational Geometry and Application"},{"volume-title":"Proceedings of the 3rd Annual Symposium on Computational Geometry (SoCG). Pages 251\u2013257","author":"Clarkson K.","key":"e_1_3_2_1_12_1","unstructured":"K. Clarkson, S. Kapoor, and P. Vaidya. 1987. Rectilinear shortest paths through polygonal obstacles in O(n \\qopname \\relax olog^2 n) time. In Proceedings of the 3rd Annual Symposium on Computational Geometry (SoCG). Pages 251\u2013257."},{"key":"e_1_3_2_1_13_1","unstructured":"K. Clarkson S. Kapoor and P. Vaidya. 1988. Rectilinear shortest paths through polygonal obstacles in O(n \\qopname \\relax olog^2\/3 n) time. Manuscript."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187714"},{"key":"e_1_3_2_1_15_1","unstructured":"E.D. Demaine J.S.B. Mitchell and J. O'Rourke. 2020. The open problem project."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215023"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.107"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220055"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90041-X"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840360"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90064-O"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(94)90010-8"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795289604"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2462356.2462374"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80044-9"},{"key":"e_1_3_2_1_26_1","unstructured":"R. Inkulu S. Kapoor and S.N. Maheshwari. 2010. A near optimal algorithm for finding Euclidean shortest path in polygonal domain. In arXiv:1011.6481v1."},{"volume-title":"Proceedings of 4th Annual ACM Symposium on Computational Geometry (SoCG). Pages 172\u2013182","author":"Kapoor S.","key":"e_1_3_2_1_27_1","unstructured":"S. Kapoor and S.N. Maheshwari. 1988. Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles. In Proceedings of 4th Annual ACM Symposium on Computational Geometry (SoCG). Pages 172\u2013182."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795253591"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009323"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212002"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.3233\/FI-1995-2243"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140304"},{"volume-title":"An optimal algorithm for shortest rectilinear paths among obstacles. Abstracts of the \\em 1st Canadian Conference on Computational Geometry","author":"Mitchell J.S.B.","key":"e_1_3_2_1_33_1","unstructured":"J.S.B. Mitchell. 1989. An optimal algorithm for shortest rectilinear paths among obstacles. Abstracts of the \\em 1st Canadian Conference on Computational Geometry."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530888"},{"key":"e_1_3_2_1_35_1","first-page":"1992","article-title":"L_1 shortest paths among polygonal obstacles in the plane","volume":"8","author":"Mitchell J.S.B.","year":"1992","unstructured":"J.S.B. Mitchell. 1992. L_1 shortest paths among polygonal obstacles in the plane. Algorithmica, 8, 1992. Pages 55\u201388.","journal-title":"Algorithmica"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195996000216"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(95)00006-U"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90012-X"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90045-1"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/6138.6151"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215014"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/185675.185795"},{"key":"e_1_3_2_1_43_1","first-page":"2020","article-title":"A divide-and-conquer algorithm for two-point L_1 shortest path queries in polygonal domains","volume":"11","author":"Wang H.","year":"2020","unstructured":"H. Wang. 2020. A divide-and-conquer algorithm for two-point L_1 shortest path queries in polygonal domains. Journal of Computational Geometry, 11, 2020. Pages 235\u2013282.","journal-title":"Journal of Computational Geometry"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.51"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Virtual Italy","acronym":"STOC '21"},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451037","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451037","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:44Z","timestamp":1750197704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":44,"alternative-id":["10.1145\/3406325.3451037","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451037","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}