{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:04Z","timestamp":1725664444243},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540587156"},{"type":"electronic","value":"9783540490548"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58715-2_124","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:41:41Z","timestamp":1330274501000},"page":"181-192","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for convex visibility problems"],"prefix":"10.1007","author":[{"given":"Supriya","family":"Biswas","sequence":"first","affiliation":[]},{"given":"D. Chithra","family":"Prasad","sequence":"additional","affiliation":[]},{"given":"Sudebkumar Prasant","family":"Pal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"S. Biswas, Chithra Prasad, and Sudebkumar Prasant Pal. Algorithms for convex visibility problems. Manuscript, 1994.","DOI":"10.1007\/3-540-58715-2_124"},{"key":"16_CR2","unstructured":"Goutam Das and Giri Narasimhan. Optimal linear-time algorithm for the shortest illuminating line segment in a polygon. In Proceedings of the ACM Symposium on Computational Geometry, 1994."},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jagm.1993.1007","volume":"14","author":"J. Doh","year":"1993","unstructured":"Jeong-In Doh and Kyung-Yong Chwa. An algorithm for determining visibility of a simple polygon from an internal line segment. Journal of Algorithms, 14: 139\u2013168, 1993.","journal-title":"Journal of Algorithms"},{"key":"16_CR4","unstructured":"H. Everett. Visibility graph recognition. PhD thesis, University of Toronto, Technical Report 231\/90, 1990."},{"key":"16_CR5","unstructured":"S. K. Ghosh. Problems in computational geometry. PhD thesis, University of Bombay, 1987."},{"key":"16_CR6","unstructured":"S. K. Ghosh, A. Maheshwari, S. P. Pal, S. Saluja, and C. E. Veni Madhavan. An algorithm for recognizing palm polygons. In Proceedings of the Second Canadian Conference in Computational Geometry (also to appear in The Visual Computer, Springer-Verlag), 1990."},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0925-7721(93)90010-4","volume":"3","author":"S. K. Ghosh","year":"1993","unstructured":"S. K. Ghosh, A. Maheshwari, S. P. Pal, S. Saluja, and C. E. Veni Madhavan. Characterizing and recognizing weak visibility polygons. Computational Geometry: Theory and Applications, 3: 213\u2013233, 1993.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. Guibas","year":"1987","unstructured":"L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. Tarjan. Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2: 209\u2013233, 1987.","journal-title":"Algorithmica"},{"key":"16_CR9","unstructured":"Y. Ke. Detecting the weak visibility of a simple polygon and related problems. Technical report, Johns Hopkins University, JHU-88\/17, 1988."},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02239742","volume":"42","author":"T. Shermer","year":"1989","unstructured":"T. Shermer. Hiding people in polygons. Computing, 42: 109\u2013132, 1989.","journal-title":"Computing"}],"container-title":["Lecture Notes in Computer Science","Foundation of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58715-2_124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:21:48Z","timestamp":1558268508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58715-2_124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540587156","9783540490548"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-58715-2_124","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}