{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:41:16Z","timestamp":1725565276903},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220572"},{"type":"electronic","value":"9783540247678"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24767-8_5","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T00:45:04Z","timestamp":1284165904000},"page":"42-52","source":"Crossref","is-referenced-by-count":1,"title":["A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface"],"prefix":"10.1007","author":[{"given":"Sasanka","family":"Roy","sequence":"first","affiliation":[]},{"given":"Sandip","family":"Das","sequence":"additional","affiliation":[]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_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":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BFb0054351","volume-title":"Algorithm Theory - SWAT\u201998","author":"L. Aleksandrov","year":"1998","unstructured":"Aleksandrov, L., Lanthier, M., Maheshwari, A., Sack, J.-R.: An \u03b5-approximation algorithm for weighted shortest paths on polyhedral surfaces. In: Arnborg, S. (ed.) SWAT 1998. LNCS, vol.\u00a01432, pp. 11\u201322. Springer, Heidelberg (1998)"},{"key":"5_CR3","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":"5_CR4","doi-asserted-by":"crossref","unstructured":"Aleksandrov, L., Maheshwari, A., Sack, J.-R.: An improved approximation algorithms for computing geometric shortest paths problems. In: Proc. Symp. on Foundations of Computing Theory, pp. 246\u2013257 (2003)","DOI":"10.1007\/978-3-540-45077-1_23"},{"key":"5_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":"5_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numerical Mathematics\u00a01, 267\u2013271 (1959)","journal-title":"Numerical Mathematics"},{"key":"5_CR7","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":"5_CR8","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":"5_CR9","doi-asserted-by":"crossref","unstructured":"Mata, C., Mitchell, J.S.B.: A new algorithm for computing shortest paths in weighted planar subdivisions. In: Proc. 13th ACM Symp. Comput. Geom., pp. 264\u2013273 (1997)","DOI":"10.1145\/262839.262983"},{"key":"5_CR10","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":"5_CR11","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":"5_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0020-0190(85)90029-8","volume":"20","author":"C.H. Papdimitriou","year":"1985","unstructured":"Papdimitriou, C.H.: An algorithm for shortest path motion in three dimension. Inform. Process. Lett.\u00a020, 259\u2013263 (1985)","journal-title":"Inform. Process. Lett."},{"key":"5_CR13","volume-title":"Handbook of computational geometry","author":"J.R. Sack","year":"2000","unstructured":"Sack, J.R., Urrutia, J.: Handbook of computational geometry. North-Holland, Elsevier Science B. V., Netherlands (2000)"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"93","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, 93\u2013215 (1986)","journal-title":"SIAM J. Computing"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1137\/S0097539799352759","volume":"30","author":"K.R. Varadarajan","year":"2000","unstructured":"Varadarajan, K.R., Agarwal, P.K.: Approximating shortest path on a non-convex polyhedron. SIAM J. Computing\u00a030, 1321\u20131340 (2000)","journal-title":"SIAM J. Computing"},{"key":"5_CR16","unstructured":"Ziegelmann, M.: Constrained shortest paths and related problems, Ph.D. Thesis, Universitat des Saarlandes (Max-Plank Institut fur Informatik) (2001)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24767-8_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:55:31Z","timestamp":1605761731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24767-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220572","9783540247678"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24767-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}