{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:47:34Z","timestamp":1725497254079},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771180"},{"type":"electronic","value":"9783540771203"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77120-3_10","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:31:09Z","timestamp":1196940669000},"page":"88-99","source":"Crossref","is-referenced-by-count":3,"title":["Dilation-Optimal Edge Deletion in Polygonal Cycles"],"prefix":"10.1007","author":[{"given":"Hee-Kap","family":"Ahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Farshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yajun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Agarwal, P.K., Klein, R., Knauer, C., Sharir, M.: Computing the detour of polygonal curves. Technical Report B 02-03, Fachbereich Mathematik und Informatik, Freie Universit\u00e4t Berlin (2002)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P.B. Callahan","year":"1995","unstructured":"Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. Journal of the ACM\u00a042, 67\u201390 (1995)","journal-title":"Journal of the ACM"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/73393.73395","volume-title":"SCG 1988: Proceedings of the fourth annual symposium on Computational geometry","author":"K.L. Clarkson","year":"1988","unstructured":"Clarkson, K.L., Shor, P.W.: Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental. In: SCG 1988: Proceedings of the fourth annual symposium on Computational geometry, pp. 12\u201317. ACM Press, New York (1988)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S.J. Fortune","year":"1987","unstructured":"Fortune, S.J.: A sweepline algorithm for Voronoi diagrams. Algorithmica\u00a02, 153\u2013174 (1987)","journal-title":"Algorithmica"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M.L. Fredman","year":"1984","unstructured":"Fredman, M.L., Komlos, J., Szemeredi, E.: Storing a sparse table with O(1) worst case access time. Journal of the ACM\u00a031, 538\u2013544 (1984)","journal-title":"Journal of the ACM"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D.G. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.G.: Optimal search in planar subdivisions. SIAM Journal on Computing\u00a012, 28\u201335 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR7","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)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0020-0190(78)90066-2","volume":"7","author":"D.T. Lee","year":"1978","unstructured":"Lee, D.T., Preparata, F.P.: The all nearest-neighbor problem for convex polygons. Information Processing Letters\u00a07, 189\u2013192 (1978)","journal-title":"Information Processing Letters"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1142\/S0218195995000167","volume":"5","author":"H.P. Lenhof","year":"1995","unstructured":"Lenhof, H.P., Smid, M.: Sequential and parallel algorithms for the k closest pairs problem. International Journal of Computational Geometry & Applications\u00a05, 273\u2013288 (1995)","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"10_CR10","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 Journal on Computing\u00a030, 978\u2013989 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G. Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)"},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1016\/B978-044482537-7\/50021-8","volume-title":"Handbook of Computational Geometry","author":"M. Smid","year":"2000","unstructured":"Smid, M.: Closest-point problems in computational geometry. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 877\u2013935. Elsevier Science, Amsterdam (2000)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:26:50Z","timestamp":1558279610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540771180","9783540771203"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}