{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:42Z","timestamp":1750306782589,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,11,5]],"date-time":"2013-11-05T00:00:00Z","timestamp":1383609600000},"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,11,5]]},"DOI":"10.1145\/2533828.2533834","type":"proceedings-article","created":{"date-parts":[[2013,12,3]],"date-time":"2013-12-03T14:37:29Z","timestamp":1386081449000},"page":"61-66","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient wayfinding in complex environments"],"prefix":"10.1145","author":[{"given":"Insu","family":"Hong","sequence":"first","affiliation":[{"name":"GeoDa Center for Geospatial Analysis and Computation, School of Geographical Science and Urban Planning, Arizona State University P.O. Box 875302, Tempe AZ 85287-5302 +1-480-965-7533"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan T.","family":"Murray","sequence":"additional","affiliation":[{"name":"GeoDa Center for Geospatial Analysis and Computation, School of Geographical Science and Urban Planning, Arizona State University P.O. Box 875302, Tempe AZ 85287-5302 +1-480-965-7533"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,11,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/359156.359164"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/136588198241635"},{"key":"e_1_3_2_1_3_1","volume-title":"Shortest path in the presence of obstacles: An application to ocean shipping. Journal of the operational research society, 51, 6 (Jun","author":"Fagerholt K.","year":"2000","unstructured":"Fagerholt , K. , Heimdal , S. and Loktu , A . Shortest path in the presence of obstacles: An application to ocean shipping. Journal of the operational research society, 51, 6 (Jun . 2000 ), 683--688. Fagerholt, K., Heimdal, S. and Loktu, A. Shortest path in the presence of obstacles: An application to ocean shipping. Journal of the operational research society, 51, 6 (Jun. 2000), 683--688."},{"key":"e_1_3_2_1_4_1","volume-title":"-G. Path planning for mobile robot using the particle swarm optimization with mutation operator","author":"Qin Y.-Q.","year":"2004","unstructured":"Qin , Y.-Q. , Sun , D.-B. , Li , N. and Cen , Y . -G. Path planning for mobile robot using the particle swarm optimization with mutation operator . IEEE , 2004 . Qin, Y.-Q., Sun, D.-B., Li, N. and Cen, Y.-G. Path planning for mobile robot using the particle swarm optimization with mutation operator. IEEE, 2004."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compenvurbsys.2003.08.002"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5784\/22-1-30"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11839088_39"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Guven G. Ergen E. Erberik M. Kurc O. and Birg\u00f6n\u00fcl M. Providing guidance for evacuation during emergency based on a real-time damage and vulnerability assessment of facilities.2012.  Guven G. Ergen E. Erberik M. Kurc O. and Birg\u00f6n\u00fcl M. Providing guidance for evacuation during emergency based on a real-time damage and vulnerability assessment of facilities.2012.","DOI":"10.1061\/9780784412343.0074"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90041-X"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366836"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Mitchell J. S. B. Geometric Shortest Paths and Network Optimization.1999.  Mitchell J. S. B. Geometric Shortest Paths and Network Optimization.1999.","DOI":"10.1016\/B978-044482537-7\/50016-4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90044-4"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840436"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220055"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(95)00016-X"},{"key":"e_1_3_2_1_16_1","volume-title":"Shortest paths for disc obstacles. Computational Science and Its Applications--ICCSA 2004(May","author":"Kim D. S.","year":"2004","unstructured":"Kim , D. S. , Yu , K. , Cho , Y. , Kim , D. and Yap , C . Shortest paths for disc obstacles. Computational Science and Its Applications--ICCSA 2004(May 2004 ), 62--70. Kim, D. S., Yu, K., Cho, Y., Kim, D. and Yap, C. Shortest paths for disc obstacles. Computational Science and Its Applications--ICCSA 2004(May 2004), 62--70."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/13658810500286935"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2093973.2094000"},{"key":"e_1_3_2_1_19_1","volume-title":"Continuous obstructed range queries in spatio-temporal databases","author":"Li Z.","year":"2011","unstructured":"Li , Z. , Gao , Y. and Lu , Y . Continuous obstructed range queries in spatio-temporal databases . IEEE , 2011 . Li, Z., Gao, Y. and Lu, Y. Continuous obstructed range queries in spatio-temporal databases. IEEE, 2011."},{"key":"e_1_3_2_1_20_1","volume-title":"Efficient computation of the geodesic Voronoi diagram of points in a simple polygon. Algorithms---ESA'95(Sep","author":"Papadopoulou E.","year":"1995","unstructured":"Papadopoulou , E. and Lee , D . Efficient computation of the geodesic Voronoi diagram of points in a simple polygon. Algorithms---ESA'95(Sep . 1995 ), 238--251. Papadopoulou, E. and Lee, D. Efficient computation of the geodesic Voronoi diagram of points in a simple polygon. Algorithms---ESA'95(Sep. 1995), 238--251."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009199"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/13658816.2013.788182"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.1991.174534"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Bhattacharya P. and Gavrilova M. L. Voronoi diagram in optimal path planning.2007.  Bhattacharya P. and Gavrilova M. L. Voronoi diagram in optimal path planning.2007.","DOI":"10.1109\/ISVD.2007.43"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISVD.2007.43"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0373463309990385"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0373463303002418"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1080\/01490419.2011.571554"},{"key":"e_1_3_2_1_29_1","volume-title":"Planning & design, 37, 4 (Jul.","author":"Lee J.-k.","year":"2010","unstructured":"Lee , J.-k. , Eastman , C. M. , Lee , J. , Kannala , M. and Jeong , Y . -s. Computing walking distances within buildings using the universal circulation network. Environment and planning. B , Planning & design, 37, 4 (Jul. 2010 ), 628. Lee, J.-k., Eastman, C. M., Lee, J., Kannala, M. and Jeong, Y.-s. Computing walking distances within buildings using the universal circulation network. Environment and planning. B, Planning & design, 37, 4 (Jul. 2010), 628."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1097\/00006324-200105000-00011"},{"key":"e_1_3_2_1_31_1","volume-title":"Personal guidance system for people with visual impairment: A comparison of spatial displays for route guidance. Journal of visual impairment & blindness, 99, 4 (Jan","author":"Loomis J. M.","year":"2005","unstructured":"Loomis , J. M. , Marston , J. R. , Golledge , R. G. and Klatzky , R. L . Personal guidance system for people with visual impairment: A comparison of spatial displays for route guidance. Journal of visual impairment & blindness, 99, 4 (Jan . 2005 ), 219. Loomis, J. M., Marston, J. R., Golledge, R. G. and Klatzky, R. L. Personal guidance system for people with visual impairment: A comparison of spatial displays for route guidance. Journal of visual impairment & blindness, 99, 4 (Jan. 2005), 219."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISWC.2007.4373786"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-006-7223-8"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/IEMBS.2008.4650195"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISWC.2011.30"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/PERCOM.2004.1276842"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90045-1"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational geometry: algorithms and applications","author":"De Berg M.","year":"2008","unstructured":"De Berg , M. , Cheong , O. and Van Kreveld , M. Computational geometry: algorithms and applications . Springer-Verlag , 2008 . De Berg, M., Cheong, O. and Van Kreveld, M. Computational geometry: algorithms and applications. Springer-Verlag, 2008."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(85)90010-4"}],"event":{"name":"SIGSPATIAL'13: 21st SIGSPATIAL International Conference on Advances in Geographic Information Systems","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information","SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"],"location":"Orlando FL USA","acronym":"SIGSPATIAL'13"},"container-title":["Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2533828.2533834","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2533828.2533834","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:05Z","timestamp":1750232045000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2533828.2533834"}},"subtitle":["derivation of a continuous space shortest path"],"short-title":[],"issued":{"date-parts":[[2013,11,5]]},"references-count":39,"alternative-id":["10.1145\/2533828.2533834","10.1145\/2533828"],"URL":"https:\/\/doi.org\/10.1145\/2533828.2533834","relation":{},"subject":[],"published":{"date-parts":[[2013,11,5]]},"assertion":[{"value":"2013-11-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}