{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:59:51Z","timestamp":1725494391338},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423065"},{"type":"electronic","value":"9783540477389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47738-1_32","type":"book-chapter","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T22:52:49Z","timestamp":1194389569000},"page":"339-350","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Algorithms for Searching a Polygonal Room with a Door"],"prefix":"10.1007","author":[{"given":"Xuehou","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1142\/S0218195995000246","volume":"5","author":"D. Crass","year":"1995","unstructured":"D. Crass, I. Suzuki and M. Yamashita, Searching for a mobile intruder in a corridor, Int. J. Comput. Geom. & Appl. 5 (1995) 397\u2013412.","journal-title":"Int. J. Comput. Geom. & Appl."},{"key":"32_CR2","unstructured":"L.J. Guibas, J.C. Latombe, S.M. Lavalle, D. Lin and R. Motwani, Finding an unpredictable target in a workspace with obstacle, in Proc. IEEE int. Conf. Robotics and Automation, 1997."},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1142\/S0218195999000273","volume":"9","author":"L.J. Guibas","year":"1999","unstructured":"L.J. Guibas, J.C. Latombe, S.M. Lavalle, D. Lin and R. Motwani, Visibility-based pursuit-evasion in a polygonal environment, Int. J. Comp. Geom. & Appl. 9, (1999) 471\u2013493.","journal-title":"Int. J. Comp. Geom. & Appl."},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1142\/S0218195996000034","volume":"6","author":"P.J. Heffernan","year":"1996","unstructured":"P.J. Heffernan, An optimal algorithm for the two-guard problem, Int. J. Comput.Geom. & Appl. 6 (1996) 15\u201344.","journal-title":"Int. J. Comput.Geom. & Appl."},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1142\/S0218195992000160","volume":"2","author":"C. Icking","year":"1992","unstructured":"C. Icking and R. Klein, The two guards problem, Int. J. Comput. Geom. & Appl. 2 (1992) 257\u2013285.","journal-title":"Int. J. Comput. Geom. & Appl."},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"S.M. LaValle, B. Simov and G. Slutzki, An algorithm for searching a polygonal region with a flashlight, in Proc. 16th Annu. ACM Symp. Comput. Geom. (2000) 260\u2013269.","DOI":"10.1145\/336154.336212"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"J.H. Lee, S.Y. Shin and K.Y. Chwa, Visibility-based pursuit-evasion in a polygonal room with a door, Proc. 15th Annu. ACM Symp. Comput. Geom. (1999) 281\u2013290.","DOI":"10.1145\/304893.304981"},{"key":"32_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1142\/S0218195900000127","volume":"10","author":"J.H. Lee","year":"2000","unstructured":"J.H. Lee, S.M. Park and K.Y. Chwa, Searching a polygonal room with one door by a 1-searcher, Int. J. Comp. Geom. & Appl. 10 (2000) 201\u2013220.","journal-title":"Int. J. Comp. Geom. & Appl."},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1137\/0221051","volume":"21","author":"I. Suzuki","year":"1992","unstructured":"I. Suzuki and M. Yamashita, Searching for mobile intruders in a polygonal region, SIAM J. Comp. 21 (1992) 863\u2013888.","journal-title":"SIAM J. Comp."},{"key":"32_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/978-3-540-46515-7_28","volume-title":"Proc. JCDCG\u201998","author":"X. Tan","year":"2000","unstructured":"X. Tan, An efficient solution to the corridor search problem, Lect. Notes Comput. Sci. 1763 (Proc. JCDCG\u201998) (2000) 317\u2013332."},{"key":"32_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/3-540-40996-3_43","volume-title":"Searching a simple polygon by a k-searcher","author":"X. Tan","year":"2000","unstructured":"X. Tan, Searching a simple polygon by a k-searcher, Preprint (see also an extended abstract in Lect. Notes Comput. Sci. 1969 (2000) 503\u2013514)."},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1142\/S0218195993000233","volume":"3","author":"X. Tan","year":"1993","unstructured":"X. Tan, T. Hirata and Y. Inagaki, An incremental algorithm for constructing shortest watchman routes, Int. J. Comp. Geom. & Appl. 3, (1993) 351\u2013365.","journal-title":"Int. J. Comp. Geom. & Appl."},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1142\/S0218195999000212","volume":"3","author":"X. Tan","year":"1999","unstructured":"X. Tan, T. Hirata and Y. Inagaki, Corrigendum to \u201cAn incremental algorithm for constructing shortest watchman routes\u201d, Int. J. Comp. Geom. & Appl. 3, (1999) 319\u2013323.","journal-title":"Int. J. Comp. Geom. & Appl."},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"M. Yamashita, H. Umemoto, I. Suzuki and T. Kameda, \u201cSearching for mobile intruders in a polygonal region by a group of mobile searchers. In Pro. 13th Annu. ACM Symp. Comput. Geom. (1997) 448\u2013450.","DOI":"10.1145\/262839.263078"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47738-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T22:10:42Z","timestamp":1588025442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47738-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423065","9783540477389"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-47738-1_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}