{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:33:32Z","timestamp":1725536012098},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033667"},{"type":"electronic","value":"9783642033674"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03367-4_5","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T07:56:42Z","timestamp":1248076602000},"page":"49-60","source":"Crossref","is-referenced-by-count":1,"title":["Connect the Dot: Computing Feed-Links with Minimum Dilation"],"prefix":"10.1007","author":[{"given":"Boris","family":"Aronov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Buchin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maike","family":"Buchin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo I.","family":"Silveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/0097-3165(89)90032-0","volume":"52","author":"P. Agarwal","year":"1989","unstructured":"Agarwal, P., Sharir, M., Shor, P.: Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences. Journal of Combinatorial Theory, Series\u00a0A\u00a052, 228\u2013274 (1989)","journal-title":"Journal of Combinatorial Theory, Series\u00a0A"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Aronov, B., Buchin, K., Buchin, M., Jansen, B., de Jong, T., van Kreveld, M., L\u00f6ffler, M., Luo, J., Silveira, R.I., Speckmann, B.: Feed-links for network extensions. In: Proc. 16th International Symposium on Advances in Geographic Information Systems, pp. 308\u2013316 (2008)","DOI":"10.1145\/1463434.1463478"},{"key":"5_CR3","unstructured":"Bose, P., Dujmovi\u0107, V.: A note on the perimeter of (\u03b1, \u03b2)-covered objects (manuscript, 2009)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s004530010047","volume":"28","author":"M. Berg de","year":"2000","unstructured":"de Berg, M.: Linear size binary space partitions for uncluttered scenes. Algorithmica\u00a028, 353\u2013366 (2000)","journal-title":"Algorithmica"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00453-002-0961-x","volume":"34","author":"M. Berg de","year":"2002","unstructured":"de Berg, M., van der Stappen, A., Vleugels, J., Katz, M.: Realistic input models for geometric algorithms. Algorithmica\u00a034, 81\u201397 (2002)","journal-title":"Algorithmica"},{"key":"5_CR6","unstructured":"de Jong, T., Tillema, T.: Transport network extensions for accessibility analysis in geographic information systems. In: Proc. AfricaGIS (2005)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00453-005-1203-9","volume":"44","author":"A. Ebbers-Baumann","year":"2006","unstructured":"Ebbers-Baumann, A., Gr\u00fcne, A., Klein, R.: The geometric dilation of finite point sets. Algorithmica\u00a044, 137\u2013149 (2006)","journal-title":"Algorithmica"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1137\/S0097539702407515","volume":"34","author":"A. Efrat","year":"2005","unstructured":"Efrat, A.: The complexity of the union of (\u03b1, \u03b2)-covered objects. SIAM Journal on Computing\u00a034, 775\u2013787 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.comgeo.2004.08.004","volume":"31","author":"J. Erickson","year":"2005","unstructured":"Erickson, J.: Local polyhedra and geometric graphs. Computational Geometry: Theory and Applications\u00a031, 101\u2013125 (2005)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Farshi, M., Giannopoulos, P., Gudmundsson, J.: Finding the best shortcut in a geometric network. In: Proc. 21st Symposium on Computational Geometry, pp. 327\u2013335 (2005)","DOI":"10.1145\/1064092.1064143"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L.J. Guibas","year":"1987","unstructured":"Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica\u00a02, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","volume":"33","author":"J. Hershberger","year":"1989","unstructured":"Hershberger, J.: Finding the upper envelope of n line segments in O(n logn) time. Information Processing Letters\u00a033, 169\u2013174 (1989)","journal-title":"Information Processing Letters"},{"key":"5_CR13","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":"5_CR14","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":"5_CR15","doi-asserted-by":"publisher","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":"5_CR16","volume-title":"Davenport-Schinzel Sequences and Their Geometric Applications","author":"M. Sharir","year":"1995","unstructured":"Sharir, M., Agarwal, P.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge (1995)"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/PL00009402","volume":"20","author":"A.F. Stappen van der","year":"1998","unstructured":"van der Stappen, A.F., Overmars, M.H., de Berg, M., Vleugels, J.: Motion planning in environments with low obstacle density. Discrete & Computational Geometry\u00a020, 561\u2013587 (1998)","journal-title":"Discrete & Computational Geometry"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0925-7721(96)00016-8","volume":"9","author":"M. Kreveld van","year":"1998","unstructured":"van Kreveld, M.: On fat partitioning, fat covering and the union size of polygons. Computational Geometry: Theory and Applications\u00a09, 197\u2013210 (1998)","journal-title":"Computational Geometry: Theory and Applications"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03367-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T06:43:12Z","timestamp":1552113792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}