{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:11Z","timestamp":1725664151626},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_235","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:11:19Z","timestamp":1330261879000},"page":"58-67","source":"Crossref","is-referenced-by-count":9,"title":["Finding the shortest watchman route in a simple polygon"],"prefix":"10.1007","author":[{"given":"Svante","family":"Carlsson","sequence":"first","affiliation":[]},{"given":"H\u00e5kan","family":"Jonsson","sequence":"additional","affiliation":[]},{"given":"Bengt J.","family":"Nilsson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"7_CR1","unstructured":"A. Aggarwal. The Art Gallery Theorem: Its Variations, Applications and Algorithmic Aspects. PhD thesis, Johns Hopkins University, 1984."},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1142\/S0218195993000063","volume":"3","author":"S. Carlsson","year":"1993","unstructured":"S. Carlsson, B.J. Nilsson, S. Ntafos. Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. International Journal of Computational Geometry and Applications, 3(1):85\u2013105, 1993.","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"B. Chazelle. Triangulating a Simple Polygon in Linear Time. In Proc. 31st Symposium on Foundations of Computer Science, pages 220\u2013230, 1990.","DOI":"10.1109\/FSCS.1990.89541"},{"issue":"1","key":"7_CR4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02574671","volume":"6","author":"W. Chin","year":"1991","unstructured":"W. Chin, S. Ntafos. Shortest Watchman Routes in Simple Polygons. Discrete and Computational Geometry, 6(1):9\u201331, 1991.","journal-title":"Discrete and Computational Geometry"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. Guibas","year":"1987","unstructured":"L. Guibas, J. Hershberger, D. Leven, M. Sharir, R. Tarjan. Linear Time Algorithms for Visibility and Shortest Path Problems inside Triangulated Simple Polygons. Algorithmic, 2:209\u2013233, 1987.","journal-title":"Algorithmic"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TIT.1986.1057165","volume":"IT-32","author":"D.T. Lee","year":"1986","unstructured":"D.T. Lee, A.K. Lin. Computational Complexity of Art Gallery Problems. IEEE Transactions on Information Theory, IT-32:276\u2013282, 1986.","journal-title":"IEEE Transactions on Information Theory"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1145\/322139.322142","volume":"26","author":"D.T. Lee","year":"1979","unstructured":"D.T. Lee, F.P. Preparata. An Optimal Algorithm for Finding the Kernel of a Polygon. Journal of the ACM, 26:415\u2013421, 1979.","journal-title":"Journal of the ACM"},{"key":"7_CR8","unstructured":"J.S.B. Mitchell, E.L. Wynters. Watchman Routes for Multiple Guards. In Proc. 3rd Canadian Conference on Computational Geometry, pages 126\u2013129, 1991."},{"key":"7_CR9","volume-title":"Technical Report \u201cBericht 43\u201d","author":"B.J. Nilsson","year":"1992","unstructured":"B.J. Nilsson, S. Schuierer. Shortest m-Watchmen Routes for Histograms: The MinMax Case. Technical Report \u201cBericht 43\u201d, Institut f\u00fcr Informatik, Universit\u00e4t Freiburg, Germany, January 1992. An extended abstract was presented at the 4th International Conference on Computing and Information, pages 31\u201334, 1992."},{"key":"7_CR10","unstructured":"B.J. Nilsson, D. Wood. Watchmen Routes in Spiral Polygons. Technical Report LU-CS-TR:90-55, Dept. of Computer Science, Lund University, 1990. An extended abstract of a preliminary version was presented at the 2nd Canadian Conference on Computational Geometry, pages 269\u2013272, 1990."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"X.-H. Tan, T. Hirata, Y. Inagaki. An Incremental Algorithm for Constructing Shortest Watchman Routes. In Proc. ISA '91 Algorithms, pages 163\u2013175. Springer Verlag, Lecture Notes in Computer Science 557, 1991.","DOI":"10.1007\/3-540-54945-5_60"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_235.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:06:17Z","timestamp":1619571977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_235","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}