{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:54:56Z","timestamp":1725512096846},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_44","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T05:07:56Z","timestamp":1209445676000},"page":"502-513","source":"Crossref","is-referenced-by-count":2,"title":["A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable"],"prefix":"10.1007","author":[{"given":"John Z.","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsunehiko","family":"Kameda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"44_CR1","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 a mobile intruder in a polygonal region. SIAM J. on Computing\u00a021(5), 863\u2013888 (1992)","journal-title":"SIAM J. on Computing"},{"issue":"3","key":"44_CR2","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\u2019l J. of Computational Geometry and Applications\u00a02(3), 257\u2013285 (1992)","journal-title":"Int\u2019l J. of Computational Geometry and Applications"},{"key":"44_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1142\/S0218195996000034","volume":"6","author":"P. Heffernan","year":"1996","unstructured":"Heffernan, P.: An optimal algorithm for the two-guard problem. Int\u2019l J. of Computational Geometry and Applications\u00a06, 15\u201344 (1996)","journal-title":"Int\u2019l J. of Computational Geometry and Applications"},{"issue":"1","key":"44_CR4","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\u2019l J. of Computational Geometry and Applications\u00a08(1), 85\u2013116 (1998)","journal-title":"Int\u2019l J. of Computational Geometry and Applications"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Bhattacharya, B.K., Mukhopadhyay, A., Narasimhan, G.: Optimal algorithms for two-guard walkability of simple polygons. In: Proc. 7th Int\u2019l Workshop on Algorithms and Data Structures, pp. 438\u2013449 (2001)","DOI":"10.1007\/3-540-44634-6_40"},{"issue":"4","key":"44_CR6","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1142\/S0218195995000246","volume":"5","author":"D. Crass","year":"1995","unstructured":"Crass, D., Suzuki, I., Yamashita, M.: Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem. Int\u2019l J. of Computational Geometry and Applications\u00a05(4), 397\u2013412 (1995)","journal-title":"Int\u2019l J. of Computational Geometry and Applications"},{"issue":"2","key":"44_CR7","doi-asserted-by":"publisher","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\u2019l J. of Computational Geometry and Applications\u00a010(2), 201\u2013220 (2000)","journal-title":"Int\u2019l J. of Computational Geometry and Applications"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Lee, J.H., Shin, S.Y., Chwa, K.Y.: Visibility-based pursuit-evasions in a polygonal room with a door. In: Proc. ACM Symp. on Computational Geometry, pp. 281\u2013290 (1999)","DOI":"10.1145\/304893.304981"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Park, S.M., Lee, J.H., Chwa, K.Y.: Characterization of rooms searchable by two guards. In: Proc. Int\u2019l Symp. on Algorithms and Computation, pp. 515\u2013526 (2000)","DOI":"10.1007\/3-540-40996-3_44"},{"issue":"4","key":"44_CR10","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1142\/S021819590200092X","volume":"12","author":"S.M. Park","year":"2002","unstructured":"Park, S.M., Lee, J.H., Chwa, K.Y.: Searching a room by two guards. Int\u2019l J. of Computational Geometry and Applications\u00a012(4), 339\u2013352 (2002)","journal-title":"Int\u2019l J. of Computational Geometry and Applications"},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Tan, X.: Efficient algorithms for searching a polygonal room with a door. In: Japanese Conf. on Discrete and Computational Geometry, pp. 339\u2013350 (2000)","DOI":"10.1007\/3-540-47738-1_32"},{"key":"44_CR12","unstructured":"Bhattacharya, B.K., Zhang, J.Z., Shi, Q.S., Kameda, T.: An optimal solution to room search problem. In: Proc. 18th Canadian Conf. on Computational Geometry, August 2006, pp. 55\u201358 (2006)"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Zhang, J.Z., Kameda, T.: Where to build a door. In: Proc. IEEE\/RSJ Int\u2019l Conf. on Intelligent Robots and Systems, October 2006, pp. 4084\u20134090 (2006)","DOI":"10.1109\/IROS.2006.281873"},{"key":"44_CR14","unstructured":"Zhang, J.Z., Kameda, T.: A linear-time algorithm for finding all door locations that make a room searchable. Technical Report CMPT TR 2007-27 (submitted to a journal), School of Computing Science, Simon Fraser University (November 2007), http:\/\/www.cs.sfu.ca\/research\/publications\/techreports\/"},{"issue":"1-2","key":"44_CR15","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\u2019l J. of Computational Geometry and Applications\u00a012(1-2), 87\u2013113 (2002)","journal-title":"Int\u2019l J. of Computational Geometry and Applications"},{"key":"44_CR16","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1109\/TRO.2006.870640","volume":"22","author":"T. Kameda","year":"2006","unstructured":"Kameda, T., Yamashita, M., Suzuki, I.: On-line polygon search by a seven-state boundary 1-searcher. IEEE Trans. on Robotics\u00a022, 446\u2013460 (2006)","journal-title":"IEEE Trans. on Robotics"},{"key":"44_CR17","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. Computational Geometry\u00a07, 37\u201357 (1997)","journal-title":"Computational Geometry"},{"key":"44_CR18","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0925-7721(00)00024-9","volume":"18","author":"B. Bhattacharya","year":"2001","unstructured":"Bhattacharya, B., Ghosh, S.K.: Characterizing LR-visibility polygons and related problems. Computational Geometry: Theory and Applications\u00a018, 19\u201336 (2001)","journal-title":"Computational Geometry: Theory and Applications"}],"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-79228-4_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:24Z","timestamp":1619522064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_44","relation":{},"subject":[]}}