{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T17:34:53Z","timestamp":1763746493653},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540543430"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0028276","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T05:52:14Z","timestamp":1132638734000},"page":"367-378","source":"Crossref","is-referenced-by-count":12,"title":["Optimum guard covers and m-watchmen routes for restricted polygons"],"prefix":"10.1007","author":[{"given":"Svante","family":"Carlsson","sequence":"first","affiliation":[]},{"given":"Bengt J.","family":"Nilsson","sequence":"additional","affiliation":[]},{"given":"Simeon","family":"Ntafos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"A. Aggarwal. The Art Gallery Theorem: Its variations, applications and algorithmic aspects. PhD thesis, Johns Hopkins University, 1984."},{"key":"33_CR2","unstructured":"W. Chin, S. Ntafos. Shortest Watchman Routes in Simple Polygons. Technical Report, Dept. of Computer Science, Univ. of Texas at Dallas, 1987."},{"key":"33_CR3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(88)90141-X","volume":"28","author":"W. Chin","year":"1988","unstructured":"W. Chin, S. Ntafos. Optimum Watchman Routes. Information Processing Letters, 28:39\u201344, 1988.","journal-title":"Information Processing Letters"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"J.C. Culberson, R.A. Reckhow. Covering Polygons is Hard. In Proc. 29th Symposium on Foundations of Computer Science, pages 601\u2013611, 1988.","DOI":"10.1109\/SFCS.1988.21976"},{"key":"33_CR5","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":"6","key":"33_CR6","first-page":"395","volume":"13","author":"V. Chv\u00e0tal","year":"1975","unstructured":"V. Chv\u00e0tal. A Combinatorial Theorem in Plane Geometry. Journal of Combinatorial Theory B, 13(6):395\u2013398, 1975.","journal-title":"Journal of Combinatorial Theory B"},{"key":"33_CR7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0734-189X(84)80041-9","volume":"27","author":"H. Edelsbrunner","year":"1984","unstructured":"H. Edelsbrunner, J. O'Rourke, E. Welzl. Stationing Guards in Rectilinear Art Galleries. Comput. Vision, Graphics, Image Processing, 27:167\u2013176, 1984.","journal-title":"Comput. Vision, Graphics, Image Processing"},{"key":"33_CR8","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0095-8956(78)90059-X","volume":"24","author":"S. Fisk","year":"1978","unstructured":"S. Fisk. A Short Proof of Chv\u00e0tal's Watchman Theorem. Journal of Combinatorial Theory B, 24:374, 1978.","journal-title":"Journal of Combinatorial Theory B"},{"key":"33_CR9","doi-asserted-by":"crossref","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":"33_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 preliminary version was presented at the 2nd Canadian Conference on Computational Geometry, pages 269\u2013272."},{"key":"33_CR11","unstructured":"J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, 1987."},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"F.P. Preparata, M.I. Shamos. Computational Geometry \u2014 an Introduction. Springer Verlag, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"33_CR13","unstructured":"J.-R. Sack. Rectilinear Computational Geometry. PhD thesis, School of Computer Science, McGill University, 1984."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028276.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:58:42Z","timestamp":1607551122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028276"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540543430"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0028276","relation":{},"subject":[]}}