{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T15:40:24Z","timestamp":1736523624928,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540377917"},{"type":"electronic","value":"9783540377931"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11821069_9","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T10:25:12Z","timestamp":1156501512000},"page":"98-109","source":"Crossref","is-referenced-by-count":5,"title":["Approximate Shortest Path Queries on Weighted Polyhedral Surfaces"],"prefix":"10.1007","author":[{"given":"Lyudmil","family":"Aleksandrov","sequence":"first","affiliation":[]},{"given":"Hristo N.","family":"Djidjev","sequence":"additional","affiliation":[]},{"given":"Hua","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"Doron","family":"Nussbaum","sequence":"additional","affiliation":[]},{"given":"J\u00f6rg-R\u00fcdiger","family":"Sack","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1137\/S0097539793253371","volume":"26","author":"P.K. Agarwal","year":"1997","unstructured":"Agarwal, P.K., Aronov, B., O\u2019Rourke, J., Schevon, C.A.: Star unfolding of a polytope with applications. SIAM J. Comput.\u00a026(6), 1689\u20131713 (1997)","journal-title":"SIAM J. Comput."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1145\/263867.263869","volume":"44","author":"P.K. Agarwal","year":"1997","unstructured":"Agarwal, P.K., Har-Peled, S., Sharir, M., Varadarajan, K.R.: Approximate shortest paths on a convex polytope in three dimensions. J. ACM\u00a044, 567\u2013584 (1997)","journal-title":"J. ACM"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S0895480194272183","volume":"9","author":"L. Aleksandrov","year":"1996","unstructured":"Aleksandrov, L., Djidjev, H.: Linear algorithms for partitioning embedded graphs of bounded genus. SIAM J. Disc. Math.\u00a09(1), 129\u2013150 (1996)","journal-title":"SIAM J. Disc. Math."},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-45643-0_8","volume-title":"Algorithm Engineering and Experiments","author":"L. Aleksandrov","year":"2002","unstructured":"Aleksandrov, L., Djidjev, H., Guo, H., Maheshwari, A.: Partitioning planar graphs with costs and weights. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol.\u00a02409, pp. 98\u2013110. Springer, Heidelberg (2002)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Aleksandrov, L., Lanthier, M., Maheshwari, A., Sack, J.-R.: An \u03b5-approximation algorithm for weighted shortest path queries on polyhedral surfaces. In: Proc. 14th Euro CG Barcelona, pp. 19\u201321 (1998)","DOI":"10.1007\/BFb0054351"},{"issue":"1","key":"9_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":"9_CR7","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1137\/S009753970444572X","volume":"35","author":"B. Chazelle","year":"2006","unstructured":"Chazelle, B., Liu, D., Magen, A.: Sublinear geometric algorithms. SIAM J. Comput.\u00a035, 627\u2013646 (2006)","journal-title":"SIAM J. Comput."},{"key":"9_CR8","unstructured":"Chen, J., Han, Y.: Shortest paths on a polyhedron. In: Proc. 6th ACM Symposium on Computational Geometry, pp. 360\u2013369 (1990); also IJCGA 6, 127\u2013144 (1996)"},{"key":"9_CR9","unstructured":"Chiang, Y.-J., Mitchell, J.S.B.: Two-point euclidean shortest path queries in the plane. In: Proc. 10th ACM-SODA, Philadelphia, USA, pp. 215\u2013224 (1999)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","first-page":"643","volume-title":"SWAT \u201988","author":"H.N. Djidjev","year":"1988","unstructured":"Djidjev, H.N.: Linear algorithms for graph separation problems. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol.\u00a0318, pp. 643\u2013645. Springer, Heidelberg (1988)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"G.N. Frederickson","year":"1987","unstructured":"Frederickson, G.N.: Fast algorithms for shortest paths in planar graphs. SIAM J. Comput.\u00a016, 1004\u20131022 (1987)","journal-title":"SIAM J. Comput."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0196-6774(84)90019-1","volume":"5","author":"J.R. Gilbert","year":"1984","unstructured":"Gilbert, J.R., Hutchinson, J.P., Tarjan, R.E.: A separator theorem for graphs of bounded genus. J. Algorithms\u00a05, 391\u2013407 (1984)","journal-title":"J. Algorithms"},{"key":"9_CR13","first-page":"216","volume":"21","author":"S. Har-Peled","year":"1999","unstructured":"Har-Peled, S.: Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions. DCG\u00a021, 216\u2013231 (1999)","journal-title":"DCG"},{"issue":"4","key":"9_CR14","doi-asserted-by":"publisher","first-page":"1182","DOI":"10.1137\/S0097539797325223","volume":"28","author":"S. Har-Peled","year":"1999","unstructured":"Har-Peled, S.: Constructing approximate shortest path maps in three dimensions. SIAM J. Comput.\u00a028(4), 1182\u20131197 (1999)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11821069_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T15:22:34Z","timestamp":1736522554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11821069_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377917","9783540377931"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11821069_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}