{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:33:28Z","timestamp":1725514408014},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_24","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T07:36:39Z","timestamp":1185089799000},"page":"262-273","source":"Crossref","is-referenced-by-count":0,"title":["Searching a Polygonal Region by Two Guards"],"prefix":"10.1007","author":[{"given":"Xuehou","family":"Tan","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","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":"24_CR2","unstructured":"Efrat, A., et al.: Sweeping simple polygons with a chain of guards. In: Proc., ACM-SIAM SODA, pp. 927\u2013936 (2000)"},{"key":"24_CR3","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, 15\u201344 (1996)","journal-title":"Int. J. Comput. Geom. & Appl."},{"key":"24_CR4","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":"24_CR5","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":"24_CR6","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":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/3-540-40996-3_44","volume-title":"Algorithms and Computation","author":"S.M. Park","year":"2000","unstructured":"Park, S.M., Lee, J.H., Chwa, K.Y.: Characterization of rooms searchable by two guards. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 515\u2013526. Springer, Heidelberg (2000)"},{"key":"24_CR8","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":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/3-540-40996-3_43","volume-title":"Algorithms and Computation","author":"X. Tan","year":"2000","unstructured":"Tan, X.: Searching a simple polygon by a k-searcher. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 503\u2013514. Springer, Heidelberg (2000)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.ipl.2006.11.010","volume":"102","author":"X. Tan","year":"2007","unstructured":"Tan, X.: Sweeping simple polygons with the minimum number of chain guards. Inform. Process. Lett.\u00a0102, 66\u201371 (2007)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:34:05Z","timestamp":1605746045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_24","relation":{},"subject":[]}}