{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:57:29Z","timestamp":1725573449656},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_3","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T08:24:24Z","timestamp":1133511864000},"page":"5-16","source":"Crossref","is-referenced-by-count":1,"title":["Embedding Point Sets into Plane Graphs of Small Dilation"],"prefix":"10.1007","author":[{"given":"Annette","family":"Ebbers-Baumann","sequence":"first","affiliation":[]},{"given":"Ansgar","family":"Gr\u00fcne","sequence":"additional","affiliation":[]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Klein","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Agarwal, P., 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 (2005) (manuscript, submitted for publication)"},{"key":"3_CR2","first-page":"148","volume-title":"Dirichlet Series in Number Theory","author":"T.M. Apostol","year":"1997","unstructured":"Apostol, T.M.: Dirichlet Series in Number Theory, 2nd edn., pp. 148\u2013155. Springer, Heidelberg (1997)","edition":"2"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1007\/3-540-61680-2_79","volume-title":"Algorithms - ESA \u201996","author":"S.R. Arikati","year":"1996","unstructured":"Arikati, S.R., Chen, D.Z., Chew, L.P., Das, G., Smid, M.: Planar Spanners and Approximate Shortest Path Queries Among Obstacles in the Plane. In: D\u00edaz, J. (ed.) ESA 1996. LNCS, vol.\u00a01136, pp. 514\u2013528. Springer, Heidelberg (1996)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/3-540-51859-2_15","volume-title":"Optimal Algorithms","author":"G. Das","year":"1989","unstructured":"Das, G., Joseph, D.: Which Triangulations Approximate the Complete Graph? In: Djidjev, H.N. (ed.) Optimal Algorithms. LNCS, vol.\u00a0401, pp. 168\u2013192. Springer, Heidelberg (1989)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF02187801","volume":"5","author":"D.P. Dobkin","year":"1990","unstructured":"Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay Graphs Are Almost as Good as Complete Graphs. Discrete & Computational Geometry\u00a05, 399\u2013407 (1990)","journal-title":"Discrete & Computational Geometry"},{"key":"3_CR6","unstructured":"Dumitrescu, A., Gr\u00fcne, A., Rote, G.: On the Geometric Dilation of Curves and Point Sets (2004) (manuscript)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/11534273_22","volume-title":"Algorithms and Data Structures","author":"A. Dumitrescu","year":"2005","unstructured":"Dumitrescu, A., Ebbers-Baumann, A., Gr\u00fcne, A., Klein, R., Rote, G.: On Geometric Dilation and Halving Chords. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol.\u00a03608, pp. 244\u2013255. Springer, Heidelberg (2005)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-540-24587-2_27","volume-title":"Algorithms and Computation","author":"A. Ebbers-Baumann","year":"2003","unstructured":"Ebbers-Baumann, A., Gr\u00fcne, A., Klein, R.: On the Geometric Dilation of Finite Point Sets. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 250\u2013259. Springer, Heidelberg (2003)"},{"key":"3_CR9","unstructured":"Ebbers-Baumann, A., Gr\u00fcne, A., Klein, R.: Geometric Dilation of Closed Planar Curves: New Lower Bounds. To appear in Computational Geometry: Theory and Applications"},{"key":"3_CR10","doi-asserted-by":"crossref","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. Computational Geometry: Theory and Applications\u00a027, 123\u2013134 (2004)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"3_CR11","first-page":"425","volume-title":"Handbook of Computational Geometry","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D.: Spanning trees and spanners. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425\u2013461. Elsevier, Amsterdam (1999)"},{"key":"3_CR12","unstructured":"Eppstein, D.: The Geometry Junkyard, http:\/\/www.ics.uci.edu\/~eppstein\/junkyard\/dilation-free\/"},{"key":"3_CR13","unstructured":"Eppstein, D., Hart, D.: Shortest Paths in an Arrangement with k Line Orientations. In: Proceedings 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 310\u2013316 (1999)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Fekete, S., Klein, R., N\u00fcchter, A.: Online Searching with an Autonomous Robot. In: Workshop on Algorithmic Foundations of Robotics (2004)","DOI":"10.1007\/10991541_11"},{"key":"3_CR15","unstructured":"Hlawka, E.: Theorie der Gleichverteilung. BI Wissenschaftsverlag"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"J.M. Keil","year":"1992","unstructured":"Keil, J.M., Gutwin, C.A.: The Delaunay Triangulation Closely Approximates the Complete Euclidean Graph. Discrete Comput. Geom.\u00a07, 13\u201328 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"3_CR17","unstructured":"Lorenz, D.: On the Dilation of Finite Point Sets. Diploma Thesis. Bonn (2005)"},{"key":"3_CR18","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (to appear)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:02:45Z","timestamp":1619506965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11602613_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}