{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:31:38Z","timestamp":1725550298756},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304678"},{"type":"electronic","value":"9783540320890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11589440_18","type":"book-chapter","created":{"date-parts":[[2005,11,9]],"date-time":"2005-11-09T07:08:15Z","timestamp":1131520095000},"page":"174-183","source":"Crossref","is-referenced-by-count":0,"title":["An Optimal Algorithm for the 1-Searchability of Polygonal Rooms"],"prefix":"10.1007","author":[{"given":"Xuehou","family":"Tan","sequence":"first","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. The. Appl.\u00a018, 19\u201336 (2001)","journal-title":"Comput. Geom. The. Appl."},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/3-540-44634-6_40","volume-title":"Algorithms and Data Structures","author":"B.K. Bhattacharya","year":"2001","unstructured":"Bhattacharya, B.K., Mukhopadhyay, A., Narasimhan, G.: Optimal algorithms for two-guard walkability of simple polygons. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol.\u00a02125, pp. 438\u2013449. Springer, Heidelberg (2001)"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B. Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discrte Comput. Geometry\u00a06, 485\u2013524 (1991)","journal-title":"Discrte Comput. Geometry"},{"key":"18_CR4","doi-asserted-by":"crossref","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, 37\u201357 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L.J. Guibas","year":"1987","unstructured":"Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica\u00a02, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1142\/S0218195999000273","volume":"9","author":"L.J. Guibas","year":"1999","unstructured":"Guibas, L.J., Latombe, J.C., Lavalle, S.M., Lin, D., Motwani, R.: Visibility-based pursuit-evasion in a polygonal environment. Int. J. Comput. Geom. & Appl.\u00a09, 471\u2013493 (1999)","journal-title":"Int. J. Comput. Geom. & Appl."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1142\/S0218195992000160","volume":"2","author":"C. Icking","year":"1992","unstructured":"Icking, C., Klein, R.: The two guards problem. Int. J. Comput. Geom. & Appl.\u00a02, 257\u2013285 (1992)","journal-title":"Int. J. Comput. Geom. & Appl."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1142\/S021819590200075X","volume":"12","author":"S.M. LaValle","year":"2002","unstructured":"LaValle, S.M., Simov, B., Slutzki, G.: An algorithm for searching a polygonal region with a flashlight. Int. J. Comput. Geom. & Appl.\u00a012, 87\u2013113 (2002)","journal-title":"Int. J. Comput. Geom. & Appl."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Lee, J.H., Shin, S.Y., Chwa, K.Y.: Visibility-based pursuit-evasion in a polygonal room with a door. In: Proc. 15th Annu. ACM Symp. Comput. Geom., pp. 281\u2013290 (1999)","DOI":"10.1145\/304893.304981"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1142\/S0218195900000127","volume":"10","author":"J.H. Lee","year":"2000","unstructured":"Lee, J.H., Park, S.M., Chwa, K.Y.: Searching a polygonal room with one door by a 1-searcher. Int. J. Comput. Geom. & Appl.\u00a010, 201\u2013220 (2000)","journal-title":"Int. J. Comput. Geom. & Appl."},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0020-0190(01)00235-6","volume":"81","author":"J.H. Lee","year":"2002","unstructured":"Lee, J.H., Park, S.M., Chwa, K.Y.: Simple algorithms for searchng a polygon with flashlights. Inform. Process. Lett.\u00a081, 265\u2013270 (2002)","journal-title":"Inform. Process. Lett."},{"key":"18_CR12","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, 863\u2013888 (1992)","journal-title":"SIAM J. Comp."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1142\/S0218195901000638","volume":"11","author":"I. Suzuki","year":"2001","unstructured":"Suzuki, I., Tazoe, Y., Yamashita, M., Kameda, T.: Searching a polygonal region from the boundary. Int. J. Comput. Geom. & Appl.\u00a011, 529\u2013553 (2001)","journal-title":"Int. J. Comput. Geom. & Appl."},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-47738-1_32","volume-title":"Discrete and Computational Geometry","author":"X. Tan","year":"2001","unstructured":"Tan, X.: Efficient algorithms for searching a polygonal room with a door. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 2000. LNCS, vol.\u00a02098, pp. 339\u2013350. Springer, Heidelberg (2001)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30540-8_22","volume-title":"Combinatorial Geometry and Graph Theory","author":"X. Tan","year":"2005","unstructured":"Tan, X.: A characterization of polygonal regions searchable from the boundary. In: Akiyama, J., Baskoro, E.T., Kano, M. (eds.) IJCCGGT 2003. LNCS, vol.\u00a03330, pp. 200\u2013215. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11589440_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:01:35Z","timestamp":1605625295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11589440_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304678","9783540320890"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11589440_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}