{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:36:33Z","timestamp":1725467793648},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642367625"},{"type":"electronic","value":"9783642367632"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36763-2_27","type":"book-chapter","created":{"date-parts":[[2013,2,13]],"date-time":"2013-02-13T22:17:33Z","timestamp":1360793853000},"page":"303-314","source":"Crossref","is-referenced-by-count":1,"title":["Covering Paths for Planar Point Sets"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Aloupis, G.: A history of linear-time convex hull algorithms for simple polygons, \n                    \n                      http:\/\/cgm.cs.mcgill.ca\/~athens\/cs601\/"},{"key":"27_CR2","doi-asserted-by":"publisher","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. Proc. Lett.\u00a086, 203\u2013207 (2003)","journal-title":"Inf. Proc. Lett."},{"issue":"4","key":"27_CR3","doi-asserted-by":"publisher","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.\u00a041(4), 513\u2013532 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"27_CR4","doi-asserted-by":"publisher","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.\u00a034, 75\u201382 (2006)","journal-title":"Comput. Geom."},{"key":"27_CR5","doi-asserted-by":"publisher","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.\u00a06, 485\u2013524 (1991)","journal-title":"Discrete Comput. Geom."},{"key":"27_CR6","first-page":"453","volume":"29","author":"V. Chv\u00e1tal","year":"1980","unstructured":"Chv\u00e1tal, V., Klincsek, G.: Finding largest convex subsets. Congressus Numerantium\u00a029, 453\u2013460 (1980)","journal-title":"Congressus Numerantium"},{"issue":"1-2","key":"27_CR7","doi-asserted-by":"publisher","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. Internat. J. Comput. Geom. Appl.\u00a014(1-2), 105\u2013114 (2004)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"27_CR8","doi-asserted-by":"publisher","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. Proc. Lett.\u00a068, 317\u2013319 (1998)","journal-title":"Inf. Proc. Lett."},{"key":"27_CR9","unstructured":"Demaine, E.D., O\u2019Rourke, J.: Open problems from CCCG 2010. In: Proc. 23rd Canadian Conf. Comput. Geom., Toronto, ON, pp. 153\u2013156 (2011)"},{"key":"27_CR10","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Mathematica\u00a02, 463\u2013470 (1935)","journal-title":"Compositio Mathematica"},{"key":"27_CR11","first-page":"53","volume":"3-4","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., Szekeres, G.: On some extremum problems in elementary geometry. Annales Univ. Sci. Budapest 3-4, 53\u201362 (1960-1961)","journal-title":"Annales Univ. Sci. Budapest"},{"key":"27_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. Journal of Universal Computer Science\u00a015, 622\u2013652 (2010)","journal-title":"Journal of Universal Computer Science"},{"key":"27_CR13","unstructured":"Fulek, R., Keszegh, B., Mori\u0107, F., Uljarevi\u0107, I.: On polygons excluding point sets. In: Proc. 22nd Canadian Conf. Comput. Geom., Winnipeg, MB, pp. 273\u2013276 (2010)"},{"key":"27_CR14","unstructured":"Gerbner, D., Keszegh, B.: Personal Communication (July 2012)"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-29700-7_6","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"M. Jiang","year":"2012","unstructured":"Jiang, M.: On Covering Points with Minimum Turns. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) FAW-AAIM 2012. LNCS, vol.\u00a07285, pp. 58\u201369. Springer, Heidelberg (2012)"},{"key":"27_CR16","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 Combinatoria\u00a038, 177\u2013192 (1994)","journal-title":"Ars Combinatoria"},{"key":"27_CR17","doi-asserted-by":"publisher","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":"27_CR18","doi-asserted-by":"publisher","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. Proc. Lett.\u00a025(1), 11\u201312 (1987)","journal-title":"Inf. Proc. Lett."},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, ch. 15, pp. 633\u2013701. Elsevier (2000)","DOI":"10.1016\/B978-044482537-7\/50016-4"},{"key":"27_CR20","unstructured":"Mori\u0107, F.: Separating and covering points in the plane. Communication at the Open Problem Session of the 22nd Canadian Conf. Comput. Geom., Winnipeg, MB (2010)"},{"key":"27_CR21","doi-asserted-by":"publisher","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":"27_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/3-540-45535-3_32","volume-title":"Integer Programming and Combinatorial Optimization","author":"C. Stein","year":"2001","unstructured":"Stein, C., Wagner, D.P.: Approximation Algorithms for the Minimum Bends Traveling Salesman Problem. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol.\u00a02081, pp. 406\u2013421. Springer, Heidelberg (2001)"},{"key":"27_CR23","unstructured":"Welzl, E.: Separating and covering points in the plane. In: Communication at the 9th Gremo\u2019s Workshop on Open Problems, Switzerland (February 2011)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36763-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T02:37:32Z","timestamp":1557542252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36763-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642367625","9783642367632"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36763-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}