{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T06:48:16Z","timestamp":1765176496352},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,12,10]],"date-time":"2013-12-10T00:00:00Z","timestamp":1386633600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s00454-013-9563-4","type":"journal-article","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T11:47:31Z","timestamp":1386589651000},"page":"462-484","source":"Crossref","is-referenced-by-count":4,"title":["Covering Paths for Planar Point Sets"],"prefix":"10.1007","volume":"51","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D\u00e1niel","family":"Gerbner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bal\u00e1zs","family":"Keszegh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,10]]},"reference":[{"key":"9563_CR1","unstructured":"Aloupis, G.: A history of linear-time convex hull algorithms for simple polygons. http:\/\/cgm.cs.mcgill.ca\/~athens\/cs601\/"},{"key":"9563_CR2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0020-0190(02)00502-1","volume":"86","author":"E.M. Arkin","year":"2003","unstructured":"Arkin, E.M., Mitchell, J.S.B., Piatko, C.D.: Minimum-link watchman tours. Inf. Process. Lett. 86, 203\u2013207 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9563_CR3","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s00454-008-9127-1","volume":"41","author":"S. Bereg","year":"2009","unstructured":"Bereg, S., Bose, P., Dumitrescu, A., Hurtado, F., Valtr, P.: Traversing a set of points with a minimum number of turns. Discrete Comput. Geom. 41(4), 513\u2013532 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"9563_CR4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.comgeo.2005.11.005","volume":"34","author":"H. Br\u00f6nnimann","year":"2006","unstructured":"Br\u00f6nnimann, H., Chan, T.M.: Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. Comput. Geom. 34, 75\u201382 (2006)","journal-title":"Comput. Geom."},{"key":"9563_CR5","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B. Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6, 485\u2013524 (1991)","journal-title":"Discrete Comput. Geom."},{"key":"9563_CR6","first-page":"453","volume":"29","author":"V. Chv\u00e1tal","year":"1980","unstructured":"Chv\u00e1tal, V., Klincsek, G.: Finding largest convex subsets. Congr. Numer. 29, 453\u2013460 (1980)","journal-title":"Congr. Numer."},{"key":"9563_CR7","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0020-0190(98)00178-1","volume":"68","author":"M.J. Collins","year":"1998","unstructured":"Collins, M.J., Moret, M.E.: Improved lower bounds for the link length of rectilinear spanning paths in grids. Inf. Process. Lett. 68, 317\u2013319 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20132","key":"9563_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1142\/S021819590400138X","volume":"14","author":"M.J. Collins","year":"2004","unstructured":"Collins, M.J.: Covering a set of points with a minimum number of turns. Int. J. Comput. Geom. Appl. 14(1\u20132), 105\u2013114 (2004)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9563_CR9","first-page":"153","volume-title":"Proc. 23rd Canadian Conf. Comput. Geom.","author":"E.D. Demaine","year":"2011","unstructured":"Demaine, E.D., O\u2019Rourke, J.: Open problems from CCCG 2010. In: Proc. 23rd Canadian Conf. Comput. Geom., Toronto, ON, pp.\u00a0153\u2013156 (2011)"},{"key":"9563_CR10","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463\u2013470 (1935)","journal-title":"Compos. Math."},{"key":"9563_CR11","first-page":"53","volume":"3\u20134","author":"P. Erd\u0151s","year":"1960\u20131961","unstructured":"Erd\u0151s, P., Szekeres, G.: On some extremum problems in elementary geometry. Ann. Univ. Sci. Bp. 3\u20134, 53\u201362 (1960\u20131961)","journal-title":"Ann. Univ. Sci. Bp."},{"key":"9563_CR12","first-page":"622","volume":"15","author":"V. Estivill-Castro","year":"2010","unstructured":"Estivill-Castro, V., Heednacram, A., Suraweera, F.: NP-completeness and FPT results for rectilinear covering problems. J. Univers. Comput. Sci. 15, 622\u2013652 (2010)","journal-title":"J. Univers. Comput. Sci."},{"issue":"6","key":"9563_CR13","doi-asserted-by":"crossref","first-page":"1741","DOI":"10.1007\/s00373-012-1221-8","volume":"29","author":"R. Fulek","year":"2013","unstructured":"Fulek, R., Keszegh, B., Mori\u0107, F., Uljarevi\u0107, I.: On polygons excluding point sets. Graphs Comb. 29(6), 1741\u20131753 (2013)","journal-title":"Graphs Comb."},{"key":"9563_CR14","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/978-3-642-29700-7_6","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management\u2014Joint International Conference (FAW-AAIM)","author":"M. Jiang","year":"2012","unstructured":"Jiang, M.: On covering points with minimum turns. In: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management\u2014Joint International Conference (FAW-AAIM). LNCS, vol.\u00a07285, pp.\u00a058\u201369. Springer, Berlin (2012)"},{"key":"9563_CR15","first-page":"177","volume":"38","author":"E. Kranakis","year":"1994","unstructured":"Kranakis, E., Krizanc, D., Meertens, L.: Link length of rectilinear Hamiltonian tours in grids. Ars Comb. 38, 177\u2013192 (1994)","journal-title":"Ars Comb."},{"key":"9563_CR16","volume-title":"Cyclopedia of Puzzles","author":"S. Loyd","year":"1914","unstructured":"Loyd, S.: Cyclopedia of Puzzles. The Lamb, Lincoln (1914)"},{"key":"9563_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J. Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer, New York (2002)"},{"issue":"1","key":"9563_CR18","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(87)90086-X","volume":"25","author":"A. Melkman","year":"1987","unstructured":"Melkman, A.: On-line construction of the convex hull of a simple polygon. Inf. Process. Lett. 25(1), 11\u201312 (1987)","journal-title":"Inf. Process. Lett."},{"key":"9563_CR19","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/B978-044482537-7\/50016-4","volume-title":"Handbook of Computational Geometry","author":"J.S.B. Mitchell","year":"2000","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633\u2013701. Elsevier, Amsterdam (2000). Chap.\u00a015"},{"key":"9563_CR20","series-title":"22nd Canadian Conf. Comput. Geom.","volume-title":"Separating and Covering Points in the Plane, Communication at the Open Problem Session","author":"F. Mori\u0107","year":"2010","unstructured":"Mori\u0107, F.: In: Separating and Covering Points in the Plane, Communication at the Open Problem Session, 22nd Canadian Conf. Comput. Geom., Winnipeg, MB (2010)"},{"key":"9563_CR21","volume-title":"Gremo\u2019s Workshop on Open Problems, Problem Booklet","author":"F. Mori\u0107","year":"2011","unstructured":"Mori\u0107, F.: Covering points by a polygonal line. In: Gremo\u2019s Workshop on Open Problems, Problem Booklet, Wergenstein, Switzerland (2011)"},{"key":"9563_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: an Introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: an Introduction. Springer, New York (1985)"},{"key":"9563_CR23","series-title":"LNCS","first-page":"406","volume-title":"ICALP","author":"C. Stein","year":"2001","unstructured":"Stein, C., Wagner, D.P.: Approximation algorithms for the minimum bends traveling salesman problem. In: ICALP. LNCS, vol. 2081, pp. 406\u2013421 (2001)"},{"key":"9563_CR24","volume-title":"Communication at the 9th Gremo\u2019s Workshop on Open Problems","author":"E. Welzl","year":"2011","unstructured":"Welzl, E.: In: Communication at the 9th Gremo\u2019s Workshop on Open Problems, Wergenstein, Switzerland (2011)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9563-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-013-9563-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9563-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:50:38Z","timestamp":1559073038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-013-9563-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,10]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["9563"],"URL":"https:\/\/doi.org\/10.1007\/s00454-013-9563-4","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,10]]}}}