{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:09:01Z","timestamp":1725548941323},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_23","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:06:19Z","timestamp":1267553179000},"page":"281-292","source":"Crossref","is-referenced-by-count":0,"title":["Shortest Monotone Descent Path Problem in Polyhedral Terrain"],"prefix":"10.1007","author":[{"given":"Sasanka","family":"Roy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandip","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00453-001-0111-x","volume":"33","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Har-Peled, S., Karia, M.: Computing approximate shortest paths on convex polytopes. Algorithmica\u00a033, 227\u2013242 (2002)","journal-title":"Algorithmica"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Aleksandrov, L., Maheshwari, A., Sack, J.-R.: Approximation algorithms for geometric shortest path problems. In: Proc. Symp. on Theory of Comput., pp. 286\u2013295 (2000)","DOI":"10.1145\/335305.335339"},{"key":"23_CR3","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.: Trekking in the Alps without freezing or getting tired. Algorithmica\u00a018, 306\u2013323 (1997)","journal-title":"Algorithmica"},{"key":"23_CR4","unstructured":"Chazelle, B.: Efficient polygon triangulation. In: Proc. of IEEE Symp. on Foundations of Computer Science, pp. 220\u2013230 (1990)"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1142\/S0218195996000095","volume":"6","author":"J. Chen","year":"1996","unstructured":"Chen, J., Han, Y.: Shortest paths on a polyhedron. Int. J. on Computational Geometry and Applications\u00a06, 127\u2013144 (1996)","journal-title":"Int. J. on Computational Geometry and Applications"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Kapoor, S.: Efficient computation of geodesic shortest paths. In: Symp. on Theory of Computing, pp. 770\u2013779 (1999)","DOI":"10.1145\/301250.301449"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00453-001-0027-5","volume":"30","author":"M. Lanthier","year":"2001","unstructured":"Lanthier, M., Maheswari, A., Sack, J.-R.: Approximating weighted shortest paths on polyhedral surfaces. Algorithmica\u00a030, 527\u2013562 (2001)","journal-title":"Algorithmica"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/0216045","volume":"16","author":"J.S.B. Mitchell","year":"1987","unstructured":"Mitchell, J.S.B., Mount, D.M., Papadimitrou, C.H.: Discrete geodesic problem. SIAM J. on Computing\u00a016, 647\u2013668 (1987)","journal-title":"SIAM J. on Computing"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/102782.102784","volume":"38","author":"J.S.B. Mitchell","year":"1991","unstructured":"Mitchell, J.S.B., Papadimitrou, C.H.: The weighted region problem: Finding shortest paths through a weighted planar subdivision. J. of the Association for Computing Machinary\u00a038, 18\u201373 (1991)","journal-title":"J. of the Association for Computing Machinary"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/0210035","volume":"10","author":"F.P. Preparata","year":"1981","unstructured":"Preparata, F.P.: A new approach to planar point location. SIAM J. Computing\u00a010, 473\u2013482 (1981)","journal-title":"SIAM J. Computing"},{"key":"23_CR11","unstructured":"Reif, J.H., Sun, Z.: An efficient approximation algorithm for weighted region shortest path problem. In: Proc. of the Workshop on Algorithmic Foundations of Robotics, pp. 191\u2013203 (2000)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-24767-8_5","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2004","author":"S. Roy","year":"2004","unstructured":"Roy, S., Das, S., Nandy, S.C.: A practical algorithm for approximating shortest weighted path between a pair of points on polyhedral surface. In: Lagan\u00e1, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol.\u00a03045, pp. 42\u201352. Springer, Heidelberg (2004)"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0215014","volume":"15","author":"M. Sharir","year":"1986","unstructured":"Sharir, M., Schorr, A.: On shortest paths in polyhedral space. SIAM J. Computing\u00a015, 193\u2013215 (1986)","journal-title":"SIAM J. Computing"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1137\/S0097539799352759","volume":"30","author":"K.R. Varadarajan","year":"2001","unstructured":"Varadarajan, K.R., Agarwal, P.K.: Approximating shortest paths on a non-convex polyhedron. SIAM J. Computing\u00a030, 1321\u20131340 (2001)","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:30:45Z","timestamp":1558287045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}