{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:18Z","timestamp":1750306878234,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,17]],"date-time":"2013-06-17T00:00:00Z","timestamp":1371427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,17]]},"DOI":"10.1145\/2462356.2462377","type":"proceedings-article","created":{"date-parts":[[2014,1,7]],"date-time":"2014-01-07T17:18:46Z","timestamp":1389115126000},"page":"369-378","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Computing shortest paths among curved obstacles in the plane"],"prefix":"10.1145","author":[{"given":"Danny Z.","family":"Chen","sequence":"first","affiliation":[{"name":"University of Notre Dame, Notre Dame, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haitao","family":"Wang","sequence":"additional","affiliation":[{"name":"Utah State University, Logan, UT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840436"},{"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.1145\/1064092.1064112"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133062"},{"key":"e_1_3_2_1_5_1","volume-title":"Computing shortest paths among curved obstacles in the plane. In arXiv:1103.3911","author":"Chen D.Z.","year":"2011","unstructured":"D.Z. Chen and H. Wang . Computing shortest paths among curved obstacles in the plane. In arXiv:1103.3911 , 2011 . D.Z. Chen and H. Wang. Computing shortest paths among curved obstacles in the plane. In arXiv:1103.3911, 2011."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/323233.323261"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840397"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01762127"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90038-X"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220055"},{"key":"e_1_3_2_1_11_1","volume-title":"Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2(1--4):209--233","author":"Guibas L.","year":"1987","unstructured":"L. Guibas , J. Hershberger , D. Leven , M. Sharir , and R.E. Tarjan . Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2(1--4):209--233 , 1987 . L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R.E. Tarjan. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2(1--4):209--233, 1987."},{"key":"e_1_3_2_1_12_1","volume-title":"Personal communications","author":"Hershberger J.","year":"2011","unstructured":"J. Hershberger . Personal communications , 2011 . J. Hershberger. Personal communications, 2011."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90003-X"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795289604"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2462356.2462374"},{"key":"e_1_3_2_1_16_1","volume-title":"A near optimal algorithm for finding Euclidean shortest path in polygonal domain. In arXiv:1011.6481v1","author":"Inkulu R.","year":"2010","unstructured":"R. Inkulu , S. Kapoor , and S.N. Maheshwari . A near optimal algorithm for finding Euclidean shortest path in polygonal domain. In arXiv:1011.6481v1 , 2010 . R. Inkulu, S. Kapoor, and S.N. Maheshwari. A near optimal algorithm for finding Euclidean shortest path in polygonal domain. In arXiv:1011.6481v1, 2010."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/73393.73411"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009323"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24767-8_7"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02716580"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221038"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195996000216"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/73393.73410"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/220279.220306"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02712876"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90045-1"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/185675.185795"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90044-4"}],"event":{"name":"SoCG '13: Symposium on Computational Geometry 2013","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Rio de Janeiro Brazil","acronym":"SoCG '13"},"container-title":["Proceedings of the twenty-ninth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2462356.2462377","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2462356.2462377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:29Z","timestamp":1750234709000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2462356.2462377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,17]]},"references-count":28,"alternative-id":["10.1145\/2462356.2462377","10.1145\/2462356"],"URL":"https:\/\/doi.org\/10.1145\/2462356.2462377","relation":{},"subject":[],"published":{"date-parts":[[2013,6,17]]},"assertion":[{"value":"2013-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}