{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:03:06Z","timestamp":1742986986708,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208768"},{"type":"electronic","value":"9783642208775"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20877-5_48","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T02:35:17Z","timestamp":1303871717000},"page":"495-504","source":"Crossref","is-referenced-by-count":0,"title":["Hide-and-Seek: Algorithms for Polygon Walk Problems"],"prefix":"10.1007","author":[{"suffix":"IV","given":"Atlas F.","family":"Cook","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenglin","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/B978-044482537-7\/50002-4","volume-title":"Handbook of Computational Geometry","author":"P.K. Agarwal","year":"2000","unstructured":"Agarwal, P.K., Sharir, M.: Davenport\u2013Schinzel Sequences and Their Geometric Applications. In: Handbook of Computational Geometry, pp. 1\u201347. Elsevier, Amsterdam (2000)"},{"key":"48_CR2","unstructured":"Cook IV, A.F., Fan, C., Luo, J.: Hide-and-seek: A linear time algorithm for polygon walk problems. In: 26th European Workshop on Computational Geometry (EuroCG), pp. 121\u2013124 (2010)"},{"key":"48_CR3","unstructured":"Efrat, A., Guibas, L.J., Har-Peled, S., Lin, D.C., Mitchell, J.S.B., Murali, T.M.: Sweeping simple polygons with a chain of guards. In: 11th Symposium on Discrete Algorithms (SODA), pp. 927\u2013936 (2000)"},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear time algorithms for visibility and shortest path problems inside simple polygons. In: 2nd Symposium on Computational Geometry (SoCG), pp. 1\u201313 (1986)","DOI":"10.1007\/BF01840360"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Heffernan, P.J.: An optimal algorithm for the two-guard problem. In: 9th Symposium on Computaitonal Geometry (SoCG), pp. 348\u2013358 (1993)","DOI":"10.1145\/160985.161163"},{"key":"48_CR6","doi-asserted-by":"crossref","unstructured":"Icking, C., Klein, R.: The two guards problem. In: 7th Symposium on Computational Geometry (SoCG), pp. 166\u2013175 (1991)","DOI":"10.1145\/109648.109667"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"LaValle, S.M., Simov, B.H., Slutzki, G.: An algorithm for searching a polygonal region with a flashlight. In: 16th Symposium on Computational Geometry (SoCG), pp. 260\u2013269 (2000)","DOI":"10.1145\/336154.336212"},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1142\/S0218195901000638","volume":"11","author":"I. Suzuki","year":"2000","unstructured":"Suzuki, I., Tazoe, Y., Yamashita, M., Kameda, T.: Searching a polygonal region from the boundary. International Journal of Computational Geometry and Applications\u00a011, 529\u2013553 (2000)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"48_CR9","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)"},{"key":"48_CR10","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1109\/12.376174","volume":"44","author":"R. Thurimella","year":"1995","unstructured":"Thurimella, R., Lopez, M.A.: On computing connected components of line segments. IEEE Transactions on Computers\u00a044, 597\u2013601 (1995)","journal-title":"IEEE Transactions on Computers"},{"key":"48_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-79228-4_44","volume-title":"Theory and Applications of Models of Computation","author":"J.Z. Zhang","year":"2008","unstructured":"Zhang, J.Z., Kameda, T.: A linear-time algorithm for finding all door locations that make a room searchable. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 502\u2013513. Springer, Heidelberg (2008)"}],"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-642-20877-5_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T13:47:48Z","timestamp":1580305668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20877-5_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208768","9783642208775"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20877-5_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}