{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:14:06Z","timestamp":1779174846685,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,11,4]],"date-time":"2009-11-04T00:00:00Z","timestamp":1257292800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HM1582-05-2-0003"],"award-info":[{"award-number":["HM1582-05-2-0003"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000266","name":"National Geospatial-Intelligence Agency","doi-asserted-by":"publisher","award":["HM1582-05-2-0003"],"award-info":[{"award-number":["HM1582-05-2-0003"]}],"id":[{"id":"10.13039\/100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,11,4]]},"DOI":"10.1145\/1653771.1653804","type":"proceedings-article","created":{"date-parts":[[2009,11,17]],"date-time":"2009-11-17T13:30:15Z","timestamp":1258464615000},"page":"227-235","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Reducing the memory required to find a geodesic shortest path on a large mesh"],"prefix":"10.1145","author":[{"given":"Vishal","family":"Verma","sequence":"first","affiliation":[{"name":"University of North Carolina at Chapel Hill"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[{"name":"University of North Carolina at Chapel Hill"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,11,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740668"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602613_34"},{"key":"e_1_3_2_1_4_1","volume-title":"In Proc. Workshop on Algorithm Engineering and Experimentation","author":"Arge L.","year":"2000","unstructured":"L. Arge , L. Toma , and J. S. Vitter . I\/O-efficient algorithms for problems on grid-based terrains . In In Proc. Workshop on Algorithm Engineering and Experimentation , 2000 . L. Arge, L. Toma, and J. S. Vitter. I\/O-efficient algorithms for problems on grid-based terrains. In In Proc. Workshop on Algorithm Engineering and Experimentation, 2000."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/512161.512197"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/98524.98601"},{"key":"e_1_3_2_1_7_1","first-page":"735","volume-title":"SODA","author":"Chowdhury R. A.","year":"2005","unstructured":"R. A. Chowdhury and V. Ramachandran . External-memory exact and approximate all-pairs shortest-paths in undirected graphs . In SODA , pages 735 -- 744 , 2005 . R. A. Chowdhury and V. Ramachandran. External-memory exact and approximate all-pairs shortest-paths in undirected graphs. In SODA, pages 735--744, 2005."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972863.13"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings Workshop on Algorithm Engineering and Experiments (ALENEX 2005","author":"Goldberg A. V.","year":"2005","unstructured":"A. V. Goldberg and R. Werneck . Computing point-to-point shortest paths from external memory . In Proceedings Workshop on Algorithm Engineering and Experiments (ALENEX 2005 ). SIAM, 2005 . A. V. Goldberg and R. Werneck. Computing point-to-point shortest paths from external memory. In Proceedings Workshop on Algorithm Engineering and Experiments (ALENEX 2005). SIAM, 2005."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1227161.1370600"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195092"},{"key":"e_1_3_2_1_14_1","volume-title":"IEEE Visualization Conference","author":"Isenburg M.","year":"2005","unstructured":"M. Isenburg and P. Lindstrom . Streaming meshes . In IEEE Visualization Conference , 2005 . M. Isenburg and P. Lindstrom. Streaming meshes. In IEEE Visualization Conference, 2005."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141992"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11863939_13"},{"key":"e_1_3_2_1_17_1","volume-title":"Workshop on Massive Data Algorithmics","author":"Isenburg M.","year":"2009","unstructured":"M. Isenburg , Y. Liu , and J. Snoeyink . Pipelined streaming: Extraction of elevation contours from LIDAR points . Workshop on Massive Data Algorithmics , June 2009 . M. Isenburg, Y. Liu, and J. Snoeyink. Pipelined streaming: Extraction of elevation contours from LIDAR points. Workshop on Massive Data Algorithmics, June 2009."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.95.15.8431"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/931222"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972894.9"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216045"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044482537-7\/50016-4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1080\/13658810600607766"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cageo.2003.11.001"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073228"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/512161.512199"}],"event":{"name":"GIS '09: 17th SIGSPATIAL International Conference on Advances in Geographic Information Systems","location":"Seattle Washington","acronym":"GIS '09","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"]},"container-title":["Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1653771.1653804","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1653771.1653804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:37Z","timestamp":1750249417000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1653771.1653804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,4]]},"references-count":26,"alternative-id":["10.1145\/1653771.1653804","10.1145\/1653771"],"URL":"https:\/\/doi.org\/10.1145\/1653771.1653804","relation":{},"subject":[],"published":{"date-parts":[[2009,11,4]]},"assertion":[{"value":"2009-11-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}