{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:53:42Z","timestamp":1725677622603},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_5","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T12:25:56Z","timestamp":1335615956000},"page":"47-57","source":"Crossref","is-referenced-by-count":0,"title":["Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region"],"prefix":"10.1007","author":[{"given":"Xuehou","family":"Tan","sequence":"first","affiliation":[]},{"given":"Bo","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H. Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. Int. J. Comput. Geom. & Appl.\u00a05, 75\u201391 (1995)","journal-title":"Int. J. Comput. Geom. & Appl."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1142\/S0218195902000839","volume":"12","author":"B. Bespamyatnikn","year":"2002","unstructured":"Bespamyatnikn, B.: An optimal morphing between polylines. Int. J. Comput. Geom. & Appl.\u00a012, 217\u2013228 (2002)","journal-title":"Int. J. Comput. Geom. & Appl."},{"key":"5_CR3","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":"5_CR4","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/BF02187747","volume":"4","author":"B. Chazelle","year":"1989","unstructured":"Chazelle, B., Guibas, L.: Visibility and intersection problem in plane geometry. Discrete Comput. Geom.\u00a04, 551\u2013581 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Cook, A.F., Wenk, C.: Geodesic Fr\u00e9chet distance inside a simple polygon. ACM Trans. Algo.\u00a07(1) (2010)","DOI":"10.1145\/1868237.1868247"},{"key":"5_CR6","unstructured":"Corman, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introdution to algorithms, 2nd edn. The MIT Press (2001)"},{"key":"5_CR7","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: Proc., ACM-SIAM Sympos. Discrete Algorithms, pp. 927\u2013936 (2000)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Ghosh, S.K.: Visibility algorithms in the plane. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511543340"},{"key":"5_CR9","first-page":"471","volume":"9","author":"L.J. Guibas","year":"1999","unstructured":"Guibas, L.J., Latombe, J.C., Lavalle, S.M., Lin, D., Motwani, R.: Visibility-based pursuit-evasion in a polygonal environment. IJCGA\u00a09, 471\u2013493 (1999)","journal-title":"IJCGA"},{"key":"5_CR10","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":"5_CR11","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":"5_CR12","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":"5_CR13","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":"5_CR14","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."},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.comgeo.2007.04.001","volume":"40","author":"X. Tan","year":"2008","unstructured":"Tan, X.: A unified and efficient solution to the room search problem. Comput. Geom. Theory Appl.\u00a040(1), 45\u201360 (2008)","journal-title":"Comput. Geom. Theory Appl."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"3312","DOI":"10.1016\/j.dam.2008.05.007","volume":"158","author":"X. Tan","year":"2008","unstructured":"Tan, X.: An efficient algorithm for the three-guard problem. Discrete Appl. Math.\u00a0158, 3312\u20133324 (2008)","journal-title":"Discrete Appl. Math."},{"key":"5_CR17","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."},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1007\/978-3-540-30551-4_72","volume-title":"Algorithms and Computation","author":"X. Tan","year":"2004","unstructured":"Tan, X.: The Two-Guard Problem Revisited and Its Generalization. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 847\u2013858. Springer, Heidelberg (2004)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-642-14553-7_29","volume-title":"Frontiers in Algorithmics","author":"X. Tan","year":"2010","unstructured":"Tan, X., Jiang, B.: Optimum Sweeps of Simple Polygons with Two Guards. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol.\u00a06213, pp. 304\u2013315. Springer, Heidelberg (2010)"},{"issue":"1","key":"5_CR20","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. J. Comput. Geom. & Appl.\u00a08(1), 85\u2013116 (1998)","journal-title":"Int. J. Comput. Geom. & Appl."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T21:24:32Z","timestamp":1594070672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}