{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:05:40Z","timestamp":1759838740225,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee, Hong Kong","doi-asserted-by":"publisher","award":["611812"],"award-info":[{"award-number":["611812"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591821","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"373-382","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Shortest paths on polyhedral surfaces and terrains"],"prefix":"10.1145","author":[{"given":"Siu-Wing","family":"Cheng","sequence":"first","affiliation":[{"name":"HKUST, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiongxin","family":"Jin","sequence":"additional","affiliation":[{"name":"Google Inc., Seattle, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_2_1_1","DOI":"10.1016\/j.jda.2009.05.001"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2_1","DOI":"10.1142\/S0218195911003755"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_3_1","DOI":"10.1007\/978-3-642-00202-1_6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_4_1","DOI":"10.1145\/1044731.1044733"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_5_1","DOI":"10.1007\/PL00009159"},{"key":"e_1_3_2_2_6_1","volume-title":"Shortest paths on a polyhedron, part I: computing shortest paths. Internat. J. Comput. Geom. Appl., 6","author":"Chen J.","year":"1996","unstructured":"J. Chen and Y. Han . Shortest paths on a polyhedron, part I: computing shortest paths. Internat. J. Comput. Geom. Appl., 6 ( 1996 ), 127--144. J. Chen and Y. Han. Shortest paths on a polyhedron, part I: computing shortest paths. Internat. J. Comput. Geom. Appl., 6 (1996), 127--144."},{"key":"e_1_3_2_2_7_1","first-page":"155","volume":"144","author":"Cheng S.-W.","year":"2013","unstructured":"S.-W. Cheng and J. Jin . Approximate shortest descending paths. Proc. 24th Annu. ACM-SIAM Sympos. Discrete Alg. , 2013 , 144 -- 155 . S.-W. Cheng and J. Jin. Approximate shortest descending paths. Proc. 24th Annu. ACM-SIAM Sympos. Discrete Alg., 2013, 144--155.","journal-title":"Approximate shortest descending paths. Proc. 24th Annu. ACM-SIAM Sympos. Discrete Alg."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_8_1","DOI":"10.1137\/06067777X"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_9_1","DOI":"10.1137\/080742166"},{"key":"e_1_3_2_2_10_1","first-page":"391","volume":"14","author":"Collischonn W.","year":"2000","unstructured":"W. Collischonn and J. V. Pilar . A direction dependent least-costs path algorithm for roads and canals. Internat. J. Geo. Info. Sci. , 14 ( 2000 ), 391 -- 406 . W. Collischonn and J. V. Pilar. A direction dependent least-costs path algorithm for roads and canals. Internat. J. Geo. Info. Sci., 14 (2000), 391--406.","journal-title":"Internat. J. Geo. Info. Sci."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_11_1","DOI":"10.1016\/0021-9045(74)90120-8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_12_1","DOI":"10.1145\/1989323.1989369"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_13_1","DOI":"10.1137\/0216045"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_14_1","DOI":"10.1145\/102782.102784"},{"key":"e_1_3_2_2_15_1","first-page":"6","volume":"1","author":"Roles J. A.","year":"2013","unstructured":"J. A. Roles and H. ElAarag . A smoothest path algorithm and its visualization tool. Proc. IEEE , 2013 , 1 -- 6 . J. A. Roles and H. ElAarag. A smoothest path algorithm and its visualization tool. Proc. IEEE, 2013, 1--6.","journal-title":"Proc. IEEE"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_16_1","DOI":"10.1137\/S0097539799352759"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_17_1","DOI":"10.1080\/1365881031000072645"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC '14","name":"STOC '14: Symposium on Theory of Computing","location":"New York New York"},"container-title":["Proceedings of the forty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/2591796.2591821","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591821","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:45Z","timestamp":1750229745000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/2591796.2591821"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":17,"alternative-id":["10.1145\/2591796.2591821","10.1145\/2591796"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/2591796.2591821","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}