{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:53Z","timestamp":1750308773170,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,4,23]],"date-time":"2006-04-23T00:00:00Z","timestamp":1145750400000},"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":[[2006,4,23]]},"DOI":"10.1145\/1141277.1141290","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"52-57","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["TerraCost"],"prefix":"10.1145","author":[{"given":"Tom","family":"Hazel","sequence":"first","affiliation":[{"name":"Bowdoin College, Brunswick, ME"}]},{"given":"Laura","family":"Toma","sequence":"additional","affiliation":[{"name":"Bowdoin College, Brunswick, ME"}]},{"given":"Jan","family":"Vahrenhold","sequence":"additional","affiliation":[{"name":"University of M\u00fcnster, M\u00fcnster, Germany"}]},{"given":"Rajiv","family":"Wickremesinghe","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC"}]}],"member":"320","published-online":{"date-parts":[[2006,4,23]]},"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","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1974","unstructured":"A. V. Aho , J. E. Hopcroft , and J. D. Ullman . The Design and Analysis of Computer Algorithms . Addison-Wesley , 1974 . A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/779232.779242"},{"key":"e_1_3_2_1_4_1","volume-title":"TPIE user manual and reference, edition 0.9.01a","author":"Arge L.","year":"1999","unstructured":"L. Arge , R. D. Barve , D. Hutchinson , O. Procopiuc , L. Toma , D. E. Vengroff , and R. Wickremesinghe . TPIE user manual and reference, edition 0.9.01a . Duke University, NC , http:\/\/www.cs.duke.edu\/TPIE\/, 1999 . L. Arge, R. D. Barve, D. Hutchinson, O. Procopiuc, L. Toma, D. E. Vengroff, and R. Wickremesinghe. TPIE user manual and reference, edition 0.9.01a. Duke University, NC, http:\/\/www.cs.duke.edu\/TPIE\/, 1999."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/945394.945395"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777427"},{"key":"e_1_3_2_1_7_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/3-540-36574-5_6","volume-title":"Algorithms for Memory Hierarchies","author":"Breimann C.","year":"2003","unstructured":"C. Breimann and J. Vahrenhold . External memory computational geometry revisited . In U. Meyer, P. Sanders, and J. Sibeyn, editors, Algorithms for Memory Hierarchies , volume 2625 of LNCS , chapter 6, pages 110 -- 148 . Springer , 2003 . C. Breimann and J. Vahrenhold. External memory computational geometry revisited. In U. Meyer, P. Sanders, and J. Sibeyn, editors, Algorithms for Memory Hierarchies, volume 2625 of LNCS, chapter 6, pages 110--148. Springer, 2003."},{"key":"e_1_3_2_1_8_1","first-page":"139","volume-title":"Proc. Symp. on Discrete Algorithms","author":"Chiang Y.-J.","year":"1995","unstructured":"Y.-J. Chiang , M. T. Goodrich , E. F. Grove , R. Tamassia , D. E. Vengroff , and J. S. Vitter . External-memory graph algorithms . In Proc. Symp. on Discrete Algorithms , pages 139 -- 149 , 1995 . Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In Proc. Symp. on Discrete Algorithms, pages 139--149, 1995."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_3_2_1_11_1","first-page":"156","volume-title":"Proc. Symp. on Discrete Algorithms","author":"Goldberg A. V.","year":"2005","unstructured":"A. V. Goldberg and C. Harrelson . Computing the shortest path: A* search meets graph theory . In Proc. Symp. on Discrete Algorithms , pages 156 -- 165 , 2005 . A. V. Goldberg and C. Harrelson. Computing the shortest path: A* search meets graph theory. In Proc. Symp. on Discrete Algorithms, pages 156--165, 2005."},{"key":"e_1_3_2_1_12_1","first-page":"26","volume-title":"Proc. Workshop on Algorithm Engineering and Experiments","author":"Goldberg A. V.","year":"2005","unstructured":"A. V. Goldberg and R. F. Werneck . An efficient external memory shortest path algorithm . In Proc. Workshop on Algorithm Engineering and Experiments , pages 26 -- 40 , 2005 . A. V. Goldberg and R. F. Werneck. An efficient external memory shortest path algorithm. In Proc. Workshop on Algorithm Engineering and Experiments, pages 26--40, 2005."},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. Workshop on Algorithm Engineering and Experiments","author":"Gutman R.","year":"2004","unstructured":"R. Gutman . Reach-based routing : A new approach to shortest path algorithms optimized for road networks . In Proc. Workshop on Algorithm Engineering and Experiments , 2004 . 100--111. R. Gutman. Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In Proc. Workshop on Algorithm Engineering and Experiments, 2004. 100--111."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_13"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/829517.830723"},{"key":"e_1_3_2_1_16_1","series-title":"IfGI Prints","first-page":"219","volume-title":"Geoinformation und Mobilit\u00e4t - von der Forschung zur praktischen Anwendung. Beitr\u00e4ge zu den M\u00fcnsteraner GI-Tagen","author":"Lauther U.","year":"2004","unstructured":"U. Lauther . An extremely fast , exact algorithm for finding shortest paths in static networks with geographical background . In Geoinformation und Mobilit\u00e4t - von der Forschung zur praktischen Anwendung. Beitr\u00e4ge zu den M\u00fcnsteraner GI-Tagen , volume 22 of IfGI Prints , pages 219 -- 230 , 2004 . U. Lauther. An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. In Geoinformation und Mobilit\u00e4t - von der Forschung zur praktischen Anwendung. Beitr\u00e4ge zu den M\u00fcnsteraner GI-Tagen, volume 22 of IfGI Prints, pages 219--230, 2004."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_18"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/384192.384193"},{"key":"e_1_3_2_1_19_1","first-page":"17","volume-title":"Proc. Workshop on Algorithm Engineering and Experiments","author":"Wagner D.","year":"2005","unstructured":"D. Wagner and T. Willhalm . Drawing graphs to speed up shortest-path computations . In Proc. Workshop on Algorithm Engineering and Experiments , pages 17 -- 25 , 2005 . D. Wagner and T. Willhalm. Drawing graphs to speed up shortest-path computations. In Proc. Workshop on Algorithm Engineering and Experiments, pages 17--25, 2005."}],"event":{"name":"SAC06: The 2006 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Dijon France","acronym":"SAC06"},"container-title":["Proceedings of the 2006 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1141277.1141290","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1141277.1141290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:37Z","timestamp":1750278157000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1141277.1141290"}},"subtitle":["a versatile and scalable approach to computing least-cost-path surfaces for massive grid-based terrains"],"short-title":[],"issued":{"date-parts":[[2006,4,23]]},"references-count":19,"alternative-id":["10.1145\/1141277.1141290","10.1145\/1141277"],"URL":"https:\/\/doi.org\/10.1145\/1141277.1141290","relation":{},"subject":[],"published":{"date-parts":[[2006,4,23]]},"assertion":[{"value":"2006-04-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}