{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T19:03:56Z","timestamp":1749323036048},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646822"},{"type":"electronic","value":"9783540691068"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054356","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T03:43:28Z","timestamp":1149651808000},"page":"71-82","source":"Crossref","is-referenced-by-count":1,"title":["Moving an angle around a region"],"prefix":"10.1007","author":[{"given":"Frank","family":"Hoffmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Icking","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Kriegel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"S. Carlsson and H. Jonsson. Computing a shortest watchman path in a simple polygon in polynomial-time. In Proc. 4th Workshop Algorithms Data Struct., volume 955 of Lecture Notes Comput. Sci., pages 122\u2013134. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60220-8_56"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"S. Carlsson, H. Jonsson, and B. J. Nilsson. Finding the shortest watchman route in a simple polygon. In Proc. 4th Annu. Internat. Sympos. Algorithms Comput., volume 762 of Lecture Notes Comput. Sci., pages 58\u201367. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57568-5_235"},{"issue":"1","key":"7_CR3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02574671","volume":"6","author":"W.-P. Chin","year":"1991","unstructured":"W.-P. Chin and S. Ntafos. Watchman routes in simple polygons. Discrete Comput. Geom., 6(1):9\u201331, 1991.","journal-title":"Discrete Comput. Geom."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"X. Deng, T. Kameda, and C. Papadimitriou. How to learn an unknown environment. In Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci., pages 298\u2013303, 1991.","DOI":"10.1109\/SFCS.1991.185382"},{"key":"7_CR5","volume-title":"Technical Report CS-93-04","author":"X. Deng","year":"1993","unstructured":"X. Deng, T. Kameda, and C. H. Papadimitriou. How to learn an unknown environment I: the rectilinear case. Technical Report CS-93-04, Department of Computer Science, York University, Canada, 1993."},{"key":"7_CR6","unstructured":"F. Hoffmann, C. Icking, R. Klein, and K. Kriegel. A competitive strategy for learning a polygon. In Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, pages 166\u2013174, 1997."},{"key":"7_CR7","unstructured":"F. Hoffmann, C. Icking, R. Klein, and K. Kriegel. The polygon exploration problem: A new strategy and a new analysis technique. In Proc. 3rd International Workshop on Algorithmic Foundations of Robotics, 1998."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"C. Icking and R. Klein. Searching for the kernel of a polygon: A competitive strategy. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 258\u2013266, 1995.","DOI":"10.1145\/220279.220307"},{"key":"7_CR9","unstructured":"C. Icking, R. Klein, and L. Ma. How to look around a corner. In Proc. 5th Canad. Conf. Comput. Geom., pages 443\u2013448, 1993."},{"key":"7_CR10","unstructured":"R. Seidel. Personal communication, 1997."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"X. Tan and T. Hirata. Constructing shortest watchman routes by divide-and-conquer. In Proc. 4th Annu. Internat. Sympos. Algorithms Comput., volume 762 of Lecture Notes Comput. Sci., pages 68\u201377. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57568-5_236"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,10]],"date-time":"2019-02-10T18:41:14Z","timestamp":1549824074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646822","9783540691068"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0054356","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}