{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:57:51Z","timestamp":1761807471117},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_6","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T07:34:01Z","timestamp":1234251241000},"page":"59-70","source":"Crossref","is-referenced-by-count":3,"title":["Shortest Gently Descending Paths"],"prefix":"10.1007","author":[{"given":"Mustaq","family":"Ahmed","sequence":"first","affiliation":[]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Ahmed, M., Das, S., Lodha, S., Lubiw, A., Maheshwari, A., Roy, S.: Approximation algorithms for shortest descending paths in terrains. CoRR, 0805.1401v1 [cs.CG] (May 2008)"},{"key":"6_CR2","unstructured":"Ahmed, M., Lubiw, A.: Shortest descending paths through given faces. In: Proceedings of the 18th Canadian Conference on Computational Geometry, pp. 35\u201338 (August 2006); accepted for publication in CCCG 2006 Special Issue of Computational Geometry: Theory and Applications"},{"key":"6_CR3","unstructured":"Ahmed, M., Lubiw, A.: An approximation algorithm for shortest descending paths. CoRR, 0705.1364v1 [cs.CG] (May 2007)"},{"key":"#cr-split#-6_CR4.1","unstructured":"Ahmed, M., Lubiw, A.: Properties of shortest descending paths. In: The 17th Fall Workshop on Computational and Combinatorial Geometry, Hawthorne, New York (November 2007);"},{"key":"#cr-split#-6_CR4.2","unstructured":"Extended abstract"},{"key":"6_CR5","unstructured":"Ahmed, M., Lubiw, A.: Shortest anisotropic paths with few bends is NP-complete. In: The 18th Fall Workshop on Computational Geometry: Abstracts, Troy, New York, pp. 28\u201329 (October 2008)"},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1044731.1044733","volume":"52","author":"L. Aleksandrov","year":"2005","unstructured":"Aleksandrov, L., Maheshwari, A., Sack, J.-R.: Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM\u00a052(1), 25\u201353 (2005)","journal-title":"J. ACM"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Cheng, S.-W., Na, H.-S., Vigneron, A., Wang, Y.: Approximate shortest paths in anisotropic regions. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp. 766\u2013774. Society for Industrial and Applied Mathematics (2007)","DOI":"10.1145\/1247069.1247082"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/PL00009159","volume":"18","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., van Kreveld, M.J.: Trekking in the Alps without freezing or getting tired. Algorithmica\u00a018(3), 306\u2013323 (1997)","journal-title":"Algorithmica"},{"key":"6_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M.J., Overmars, M., Cheong, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Berlin (2000)","edition":"2"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/3-540-48523-6_49","volume-title":"Automata, Languages and Programming","author":"M. Lanthier","year":"1999","unstructured":"Lanthier, M., Maheshwari, A., Sack, J.-R.: Shortest anisotropic paths on terrains. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 524\u2013533. Springer, Heidelberg (1999)"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/102782.102784","volume":"38","author":"J.S.B. Mitchell","year":"1991","unstructured":"Mitchell, J.S.B., Papadimitriou, C.H.: The weighted region problem: finding shortest paths through a weighted planar subdivision. J. ACM\u00a038(1), 18\u201373 (1991)","journal-title":"J. ACM"},{"issue":"5","key":"6_CR12","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1109\/70.62043","volume":"6","author":"N.C. Rowe","year":"1990","unstructured":"Rowe, N.C., Ross, R.S.: Optimal grid-free path planning across arbitrarily-contoured terrain with anisotropic friction and gravity effects. IEEE Trans. Robot. Autom.\u00a06(5), 540\u2013553 (1990)","journal-title":"IEEE Trans. Robot. Autom."},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.comgeo.2006.06.003","volume":"37","author":"S. Roy","year":"2007","unstructured":"Roy, S., Das, S., Nandy, S.C.: Shortest monotone descent path problem in polyhedral terrain. Comput. Geom. Theory Appl.\u00a037(2), 115\u2013133 (2007)","journal-title":"Comput. Geom. Theory Appl."},{"key":"6_CR14","unstructured":"Roy, S., Lodha, S., Das, S., Maheshwari, A.: Approximate shortest descent path on a terrain. In: Proceedings of the 19th Canadian Conference on Computational Geometry, pp. 189\u2013192 (August 2007)"},{"issue":"4","key":"6_CR15","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.ipl.2005.10.007","volume":"97","author":"Z. Sun","year":"2006","unstructured":"Sun, Z., Bu, T.-M.: On discretization methods for approximating optimal paths in regions with direction-dependent costs. Inform. Process. Lett.\u00a097(4), 146\u2013152 (2006)","journal-title":"Inform. Process. Lett."},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-45678-3_15","volume-title":"Algorithms and Computation","author":"Z. Sun","year":"2001","unstructured":"Sun, Z., Reif, J.H.: BUSHWHACK: An approximation algorithm for minimal paths through pseudo-euclidean spaces. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 160\u2013171. Springer, Heidelberg (2001)"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/TRO.2004.837232","volume":"21","author":"Z. Sun","year":"2005","unstructured":"Sun, Z., Reif, J.H.: On finding energy-minimizing paths on terrains. IEEE Transactions on Robotics\u00a021(1), 102\u2013114 (2005)","journal-title":"IEEE Transactions on Robotics"},{"issue":"1","key":"6_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2004.07.004","volume":"58","author":"Z. Sun","year":"2006","unstructured":"Sun, Z., Reif, J.H.: On finding approximate optimal paths in weighted regions. J. Algorithms\u00a058(1), 1\u201332 (2006)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T07:59:35Z","timestamp":1551772775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}