{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T18:23:38Z","timestamp":1585160618183},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540646822","type":"print"},{"value":"9783540691068","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054351","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:43:28Z","timestamp":1149666208000},"page":"11-22","source":"Crossref","is-referenced-by-count":30,"title":["An \u03b5 \u2014 Approximation algorithm for weighted shortest paths on polyhedral surfaces"],"prefix":"10.1007","author":[{"given":"Lyudmil","family":"Aleksandrov","sequence":"first","affiliation":[]},{"given":"Mark","family":"Lanthier","sequence":"additional","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"J\u00f6rg -R.","family":"Sack","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"2_CR1","unstructured":"L. Aleksandrov, M. Lanthier, A. Maheshwari and J.-R. Sack, \u201cAn \u03b5-Approximation Algorithm for Weighted Shortest Path Queries on Polyhedral Surfaces\u201d, to appear 14th European Workshop on Computational Geometry, Barcelona, Spain, 1998.","DOI":"10.1007\/BFb0054351","doi-asserted-by":"crossref"},{"key":"2_CR2","unstructured":"J. Choi, J. Sellen and C.K. Yap, \u201cApproximate Euclidean Shortest Path in 3-Space\u201d, Proc. 10th Annual Symp. on Computational Geometry, 1994, pp. 41\u201348.","DOI":"10.1145\/177424.177501","doi-asserted-by":"crossref"},{"key":"2_CR3","unstructured":"G. Das and G. Narasimhan, \u201cShort Cuts in Higher Dimensional Space\u201d, Proceedings of the 7th Annual Canadian Conference on Computational Geometry, Qu\u00e9bec City, Qu\u00e9bec, 1995, pp. 103\u2013108."},{"issue":"3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"M.L. Fredman and R.E. Tarjan, \u201cFibonacci Heaps and Their Uses in Improved Network Optimization Algorithms\u201d, J. ACM, 34(3), 1987, pp.596\u2013615.","journal-title":"J. ACM"},{"key":"2_CR5","unstructured":"J. Goodman and J. O'Rourke, Eds., Handbook of Discrete and Computational Geometry, CRC Press LLC, Chapter 24, 1997, pp. 445\u2013466."},{"key":"2_CR6","author":"P. Johansson","year":"1997","unstructured":"P. Johansson, \u201cOn a Weighted Distance Model for Injection Molding\u201d, Link\u00f6ping Studies in Science and Technology, Thesis no. 604 LiU-TEK-LIC-1997:05, Division of Applied Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden, 1997.","series-title":"Thesis no. 604 LiU-TEK-LIC-1997:05","volume-title":"Link\u00f6ping Studies in Science and Technology"},{"issue":"No.3","key":"2_CR7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF02293048","volume":"8","author":"C. Kenyon","year":"1992","unstructured":"C. Kenyon and R. Kenyon, \u201cHow To Take Short Cuts\u201d, Discrete and Computational Geometry, Vol. 8, No. 3, 1992, pp. 251\u2013264.","journal-title":"Discrete and Computational Geometry"},{"key":"2_CR8","unstructured":"M. Lanthier, A. Maheshwari and J.-R. Sack, \u201cApproximating Weighted Shortest Paths on Polyhedral Surfaces\u201d, Proceedings of the 13th Annual ACM Symposium on Computational Geometry, 1997, pp. 274\u2013283.","DOI":"10.1145\/262839.262984","doi-asserted-by":"crossref"},{"key":"2_CR9","author":"M. Lanthier","year":"1998","unstructured":"M. Lanthier, \u201cShortest Path Problems on Polyhedral Surfaces\u201d, Ph.D. Thesis in progress, School of Computer Science, Carleton University, Ottawa, Canada, 1998.","volume-title":"Ph.D. Thesis in progress"},{"key":"2_CR10","unstructured":"C. Mata and J. Mitchell, \u201cA New Algorithm for Computing Shortest Paths in Weighted Planar Subdivisions\u201d, Proceedings of the 13th Annual ACM Symposium on Computational Geometry, 1997, pp. 264\u2013273.","DOI":"10.1145\/262839.262983","doi-asserted-by":"crossref"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/102782.102784","volume":"38","author":"J.S.B. Mitchell","year":"1991","unstructured":"J.S.B. Mitchell and C.H. Papadimitriou, \u201cThe Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision\u201d, Journal of the ACM, 38, January 1991, pp. 18\u201373.","journal-title":"Journal of the ACM"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0020-0190(85)90029-8","volume":"20","author":"C.H. Papadimitriou","year":"1985","unstructured":"C.H. Papadimitriou, \u201cAn Algorithm for Shortest Path Motion in Three Dimensions\u201d, Information Processing Letters, 20, 1985, pp. 259\u2013263.","journal-title":"Information Processing Letters"},{"key":"2_CR13","unstructured":"J.-R. Sack and J. Urrutia Eds., Handbook on Computational Geometry, Elsevier Science B.V., to appear."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0215014","volume":"15","author":"M. Sharir","year":"1986","unstructured":"M. Sharir and A. Schorr, \u201cOn Shortest Paths in Polyhedral Spaces\u201d, SIAM Journal of Computing, 15, 1986, pp. 193\u2013215.","journal-title":"SIAM Journal of Computing"},{"key":"2_CR15","unstructured":"Paradigm Group Webpage, School of Computer Science, Carleton University, http:\/\/www.scs.carleton.ca\/~gis."}],"container-title":["Algorithm Theory \u2014 SWAT'98","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T06:46:54Z","timestamp":1555656414000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646822","9783540691068"],"references-count":15,"URL":"http:\/\/dx.doi.org\/10.1007\/bfb0054351","relation":{"cites":[]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}]}}