{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:31:06Z","timestamp":1725568266040},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671817"},{"type":"electronic","value":"9783540465157"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-540-46515-7_28","type":"book-chapter","created":{"date-parts":[[2010,10,20]],"date-time":"2010-10-20T09:35:28Z","timestamp":1287567328000},"page":"317-331","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Solution to the Corridor Search Problem"],"prefix":"10.1007","author":[{"given":"Xuehou","family":"Tan","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/BF02187747","volume":"4","author":"B. Chazelle","year":"1989","unstructured":"Chazelle, B., Guibas, L.J.: Visibility and intersection problems in plane geometry. Disc. Comput. Geom.\u00a04, 551\u2013581 (1989)","journal-title":"Disc. Comput. Geom."},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Crass, D., Suzuki, I., Yamashita, M.: Search for a mobile intruder in a corridor. In: IJCGA, vol.\u00a05, pp. 397\u2013412 (1995)","DOI":"10.1142\/S0218195995000246"},{"key":"28_CR3","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":"28_CR4","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"L.J. Guibas","year":"1989","unstructured":"Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. J. Comput. Sys. Set.\u00a039, 126\u2013152 (1989)","journal-title":"J. Comput. Sys. Set."},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-63307-3_45","volume-title":"Algorithms and Data Structures","author":"L.J. Guibas","year":"1997","unstructured":"Guibas, L.J., Latombe, J.C., Lavalle, S.M., Lin, D., Motwani, R.: Visibility-based pursuit-evasion in a polygonal environment. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol.\u00a01272, pp. 17\u201330. Springer, Heidelberg (1997)"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Heffernan, P.J.: An optimal algorithm for the two-guard problem. In: IJCGA, vol.\u00a06, pp. 15\u201344 (1996)","DOI":"10.1142\/S0218195996000034"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Icking, C., Klein, R.: The two guards problem. In: IJCGA, vol.\u00a02, pp. 257\u2013285 (1992)","DOI":"10.1142\/S0218195992000160"},{"key":"28_CR8","unstructured":"Ke, Y.: Detecting the weak visibility of a simple polygon and related problems, Tech. Rept., John Hopkins University (1987)"},{"key":"28_CR9","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":"28_CR10","doi-asserted-by":"crossref","unstructured":"Suzuki, I., Yamashita, M., Umemoto, H., Kameda, T.: Bushiness and a tight worst-case upper bound on the search number of a simple polygon. In: IPL, vol.\u00a066, pp. 49\u201352 (1998)","DOI":"10.1016\/S0020-0190(98)00029-5"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-46515-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T12:47:51Z","timestamp":1559738871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-46515-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671817","9783540465157"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-46515-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}