{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:21:20Z","timestamp":1725571280165},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_11","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:09:23Z","timestamp":1291388963000},"page":"121-131","source":"Crossref","is-referenced-by-count":0,"title":["Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane"],"prefix":"10.1007","author":[{"given":"Ansgar","family":"Gr\u00fcne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tien-Ching","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teng-Kai","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elmar","family":"Langetepe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. T.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheung-Hung","family":"Poon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00454-007-9019-9","volume":"39","author":"P.K. Agarwal","year":"2008","unstructured":"Agarwal, P.K., Klein, R., Knauer, C., Langerman, S., Morin, P., Sharir, M., Soss, M.: Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. Discrete Comput. Geom.\u00a039(1-3), 17\u201337 (2008)","journal-title":"Discrete Comput. Geom."},{"key":"11_CR2","unstructured":"Agarwal, P.K., Klein, R., Knauer, C., Sharir, M.: Computing the Detour of Polygonal Curves, TRB 02-03, Freie Universit\u00e4t Berlin, Fachbereich Mathematik und Informatik (2002)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(00)00233-X","volume":"109","author":"O. Aichholzer","year":"2001","unstructured":"Aichholzer, O., Aurenhammer, F., Icking, C., Klein, R., Langetepe, E., Rote, G.: Generalized Self-approaching Curves. Discrete Appl. Math.\u00a0109, 3\u201324 (2001)","journal-title":"Discrete Appl. Math."},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-45022-X_8","volume-title":"Automata, Languages and Programming","author":"S. Alstrup","year":"2000","unstructured":"Alstrup, S., Holm, J.: Improved Algorithms for Finding Level Ancestors in Dynamic Trees. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 73\u201384. Springer, Heidelberg (2000)"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0925-7721(03)00046-4","volume":"27","author":"A. Ebbers-Baumann","year":"2004","unstructured":"Ebbers-Baumann, A., Klein, R., Langetepe, E., Lingas, A.: A Fast Algorithm for Approximating the Detour of a Polygonal Chain. Comput. Geom. Theory Appl.\u00a027, 123\u2013134 (2004)","journal-title":"Comput. Geom. Theory Appl."},{"key":"11_CR6","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill (2001)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry, Second Revised Edition, pp. 105\u2013110. Springer, Heidelberg (2000), Section 5.3: Range Trees"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM\u00a034(3), 596\u2013615 (1987)","journal-title":"Journal of the ACM"},{"key":"11_CR10","unstructured":"Gr\u00fcne, A.: Umwege in Polygonen. Diploma Thesis, Institute of Computer Science I, Bonn (2002)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Gudmundsson, J., Knauer, C.: Dilation and Detours in Geometric Networks. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithm and Metaheuristics. Chapman & Hall\/CRC (2007), Section 52","DOI":"10.1201\/9781420010749.ch52"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1006\/jagm.1996.0054","volume":"21","author":"J. Hershberger","year":"1996","unstructured":"Hershberger, J., Suri, S.: Offline maintenance of planar configurations. J. Algorithms\u00a021, 453\u2013475 (1996)","journal-title":"J. Algorithms"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1017\/S0305004198003016","volume":"125","author":"C. Icking","year":"1999","unstructured":"Icking, C., Klein, R., Langetepe, E.: Self-approaching curves. Math. Proc. Camb. Philos. Soc.\u00a0125, 441\u2013453 (1999)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45841-7_20","volume-title":"STACS 2002","author":"S. Langerman","year":"2002","unstructured":"Langerman, S., Morin, P., Soss, M.: Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees and Cycles. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 250\u2013261. Springer, Heidelberg (2002)"},{"issue":"3","key":"11_CR15","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1137\/S0097539799361671","volume":"30","author":"G. Narasimhan","year":"2000","unstructured":"Narasimhan, G., Smid, M.: Approximating the Stretch Factor of Euclidean Graphs. SIAM J. Comput.\u00a030(3), 978\u2013989 (2000)","journal-title":"SIAM J. Comput."},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1145\/359131.359132","volume":"22","author":"F.P. Preparata","year":"1978","unstructured":"Preparata, F.P.: An Optimal Real Time Algorithm for Planar Convex Hulls. Comm. ACM\u00a022, 402\u2013405 (1978)","journal-title":"Comm. ACM"},{"key":"11_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introducation","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introducation. Springer, New York (1985)"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0305004100071875","volume":"115","author":"G. Rote","year":"1994","unstructured":"Rote, G.: Curves with increasing chords. Math. Proc. Camb. Philos. Soc.\u00a0115, 1\u201312 (1994)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1007\/978-3-540-92182-0_65","volume-title":"Algorithms and Computation","author":"C. Wulff-Nilsen","year":"2008","unstructured":"Wulff-Nilsen, C.: Computing the Maximum Detour of a Plane Graph in Subquadratic Time. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 740\u2013751. Springer, Heidelberg (2008)"},{"issue":"4","key":"11_CR20","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1137\/0220041","volume":"20","author":"A.C.-C. Yao","year":"1991","unstructured":"Yao, A.C.-C.: Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains. SIAM Journal on Computing\u00a020(4), 655\u2013668 (1991)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T13:03:26Z","timestamp":1553259806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}