{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T13:52:46Z","timestamp":1725630766197},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642249822"},{"type":"electronic","value":"9783642249839"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24983-9_18","type":"book-chapter","created":{"date-parts":[[2011,11,7]],"date-time":"2011-11-07T00:07:20Z","timestamp":1320624440000},"page":"176-187","source":"Crossref","is-referenced-by-count":0,"title":["Simple Characterization of LR-visibility Polygons"],"prefix":"10.1007","author":[{"given":"Xuehou","family":"Tan","sequence":"first","affiliation":[]},{"given":"Jing","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0925-7721(00)00024-9","volume":"18","author":"B.K. Bhattacharya","year":"2001","unstructured":"Bhattacharya, B.K., Ghosh, S.K.: Characterizing LR-visibility polygons and related problems. Comput. Geom. Theory Appl.\u00a018, 19\u201336 (2001)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1142\/S0218195996000034","volume":"6","author":"P.J. Heffernan","year":"1996","unstructured":"Heffernan, P.J.: An optimal algorithm for the two-guard problem. Int. J. Comput. Geom. Appl.\u00a06(1), 15\u201344 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"18_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0925-7721(95)00042-9","volume":"7","author":"G. Das","year":"1997","unstructured":"Das, G., Heffernan, P.J., Narasimhan, G.: LR-visibility in polygons. Comput. Geom. Theory Appl.\u00a07(1), 37\u201357 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Ghosh, S.K.: Visibility problems in the plane. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511543340"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. Guibas","year":"1987","unstructured":"Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica\u00a02, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"issue":"5","key":"18_CR6","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1137\/0221051","volume":"21","author":"I. Suzuki","year":"1992","unstructured":"Suzuki, I., Yamashita, M.: Searching for mobile intruders in a polygonal region. SIAM J. Comp.\u00a021(5), 863\u2013888 (1992)","journal-title":"SIAM J. Comp."},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.comgeo.2007.04.001","volume":"40","author":"X. Tan","year":"2008","unstructured":"Tan, X.: A unified and efficient solution to the room search problem. Comput. Geom. Theory Appl.\u00a040(1), 45\u201360 (2008)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1142\/S0218195998000060","volume":"8","author":"L.H. Tseng","year":"1998","unstructured":"Tseng, L.H., Heffernan, P.J., Lee, D.T.: Two-guard walkability of simple polygons. Int. J. Comput. Geom. Appl.\u00a08(1), 85\u2013116 (1998)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"18_CR9","unstructured":"O\u2019Rourke, J.: Computational Geometry in C. Cambridge University Press (1993)"}],"container-title":["Lecture Notes in Computer Science","Computational Geometry, Graphs and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24983-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T00:28:26Z","timestamp":1560904106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24983-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642249822","9783642249839"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24983-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}