Berry, Lindsay; Beveridge, Andrew; Butterfield, Jane; Isler, Volkan; Keller, Zachary; Shine, Alana; Wang, Junyi Line-of-sight pursuit in monotone and scallop polygons. (English) Zbl 1461.91050 Int. J. Comput. Geom. Appl. 29, No. 4, 307-351 (2019). MSC: 91A24 PDFBibTeX XMLCite \textit{L. Berry} et al., Int. J. Comput. Geom. Appl. 29, No. 4, 307--351 (2019; Zbl 1461.91050) Full Text: DOI arXiv
Aurenhammer, Franz; Steinkogler, Michael; Klein, Rolf Partially walking a polygon. (English) Zbl 07561414 Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 60, 9 p. (2018). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. Aurenhammer} et al., LIPIcs -- Leibniz Int. Proc. Inform. 123, Article 60, 9 p. (2018; Zbl 07561414) Full Text: DOI
Tan, Xuehou; Jiang, Bo; Zhang, Jing Characterizing and recognizing LR-visibility polygons. (English) Zbl 1296.68181 Discrete Appl. Math. 165, 303-311 (2014). MSC: 68U05 PDFBibTeX XMLCite \textit{X. Tan} et al., Discrete Appl. Math. 165, 303--311 (2014; Zbl 1296.68181) Full Text: DOI
Tan, Xuehou; Jiang, Bo Minimization of the maximum distance between the two guards patrolling a polygonal region. (English) Zbl 1417.68252 Theor. Comput. Sci. 532, 73-79 (2014). MSC: 68U05 68R10 PDFBibTeX XMLCite \textit{X. Tan} and \textit{B. Jiang}, Theor. Comput. Sci. 532, 73--79 (2014; Zbl 1417.68252) Full Text: DOI
Tan, Xuehou; Jiang, Bo Optimum sweeps of simple polygons with two guards. (English) Zbl 1284.68619 Inf. Process. Lett. 114, No. 3, 130-136 (2014). MSC: 68U05 52B05 PDFBibTeX XMLCite \textit{X. Tan} and \textit{B. Jiang}, Inf. Process. Lett. 114, No. 3, 130--136 (2014; Zbl 1284.68619) Full Text: DOI
Jiang, Bo; Tan, Xuehou Searching for mobile intruders in circular corridors by two 1-searchers. (English) Zbl 1225.68265 Discrete Appl. Math. 159, No. 16, 1793-1805 (2011). MSC: 68U05 68T20 68T40 PDFBibTeX XMLCite \textit{B. Jiang} and \textit{X. Tan}, Discrete Appl. Math. 159, No. 16, 1793--1805 (2011; Zbl 1225.68265) Full Text: DOI
Cook, Atlas F. IV; Fan, Chenglin; Luo, Jun Hide-and-seek: algorithms for polygon walk problems. (English) Zbl 1331.68249 Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 495-504 (2011). MSC: 68U05 PDFBibTeX XMLCite \textit{A. F. Cook IV} et al., Lect. Notes Comput. Sci. 6648, 495--504 (2011; Zbl 1331.68249) Full Text: DOI
Kameda, Tsunehiko; Zhang, John Z. Finding all door locations that make a room searchable. (English) Zbl 1190.90077 Int. J. Comput. Geom. Appl. 20, No. 2, 175-201 (2010). MSC: 90B40 PDFBibTeX XMLCite \textit{T. Kameda} and \textit{J. Z. Zhang}, Int. J. Comput. Geom. Appl. 20, No. 2, 175--201 (2010; Zbl 1190.90077) Full Text: DOI
Simov, Borislav H.; Slutzki, Giora; Lavalle, Steven M. Clearing a polygon with two 1-searchers. (English) Zbl 1170.65014 Int. J. Comput. Geom. Appl. 19, No. 1, 59-92 (2009). MSC: 65D18 70B15 PDFBibTeX XMLCite \textit{B. H. Simov} et al., Int. J. Comput. Geom. Appl. 19, No. 1, 59--92 (2009; Zbl 1170.65014) Full Text: DOI
Tan, Xuehou An efficient algorithm for the three-guard problem. (English) Zbl 1162.68773 Discrete Appl. Math. 156, No. 17, 3312-3324 (2008). MSC: 68U05 PDFBibTeX XMLCite \textit{X. Tan}, Discrete Appl. Math. 156, No. 17, 3312--3324 (2008; Zbl 1162.68773) Full Text: DOI
Zhang, John Z.; Kameda, Tsunehiko A linear-time algorithm for finding all door locations that make a room searchable. (Extended abstract). (English) Zbl 1139.68416 Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 5th international conference, TAMC 2008, Xi’an, China, April 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79227-7/pbk). Lecture Notes in Computer Science 4978, 502-513 (2008). MSC: 68U05 52B55 68Q25 68W05 PDFBibTeX XMLCite \textit{J. Z. Zhang} and \textit{T. Kameda}, Lect. Notes Comput. Sci. 4978, 502--513 (2008; Zbl 1139.68416) Full Text: DOI
Tan, Xuehou A unified and efficient solution to the room search problem. (English) Zbl 1138.65023 Comput. Geom. 40, No. 1, 45-60 (2008). MSC: 65D18 90B35 PDFBibTeX XMLCite \textit{X. Tan}, Comput. Geom. 40, No. 1, 45--60 (2008; Zbl 1138.65023) Full Text: DOI
Tan, Xuehou Sweeping simple polygons with the minimum number of chain guards. (English) Zbl 1184.68571 Inf. Process. Lett. 102, No. 2-3, 66-71 (2007). MSC: 68U05 68W40 PDFBibTeX XMLCite \textit{X. Tan}, Inf. Process. Lett. 102, No. 2--3, 66--71 (2007; Zbl 1184.68571) Full Text: DOI
Bose, Prosenjit; van Kreveld, Marc Generalizing monotonicity: On recognizing special classes of polygons and polyhedra. (English) Zbl 1088.65013 Int. J. Comput. Geom. Appl. 15, No. 6, 591-608 (2005). Reviewer: Vladimir Yu. Rovenskij (Nesher) MSC: 65D18 52B55 PDFBibTeX XMLCite \textit{P. Bose} and \textit{M. van Kreveld}, Int. J. Comput. Geom. Appl. 15, No. 6, 591--608 (2005; Zbl 1088.65013) Full Text: DOI
Yamashita, Masafumi; Suzuki, Ichiro; Kameda, Tiko Searching a polygonal region by a group of stationary \(k\)-searchers. (English) Zbl 1173.68471 Inf. Process. Lett. 92, No. 1, 1-8 (2004). MSC: 68P10 PDFBibTeX XMLCite \textit{M. Yamashita} et al., Inf. Process. Lett. 92, No. 1, 1--8 (2004; Zbl 1173.68471) Full Text: DOI
Park, Sang-Min; Lee, Jae-Ha; Chwa, Kyung-Yong Searching a room by two guards. (English) Zbl 1152.68675 Int. J. Comput. Geom. Appl. 12, No. 4, 339-352 (2002). MSC: 68U05 PDFBibTeX XMLCite \textit{S.-M. Park} et al., Int. J. Comput. Geom. Appl. 12, No. 4, 339--352 (2002; Zbl 1152.68675) Full Text: DOI
Lavalle, Steven M.; Simov, Borislav H.; Slutzki, Giora An algorithm for searching a polygonal region with a flashlight. (English) Zbl 1117.68527 Int. J. Comput. Geom. Appl. 12, No. 1-2, 87-113 (2002). MSC: 68U05 68T40 91A24 PDFBibTeX XMLCite \textit{S. M. Lavalle} et al., Int. J. Comput. Geom. Appl. 12, No. 1--2, 87--113 (2002; Zbl 1117.68527) Full Text: DOI
Lee, Jae-Ha; Park, Sang-Min; Chwa, Kyung-Yong Simple algorithms for searching a polygon with flashlights. (English) Zbl 1053.68107 Inf. Process. Lett. 81, No. 5, 265-270 (2002). MSC: 68U05 68W05 PDFBibTeX XMLCite \textit{J.-H. Lee} et al., Inf. Process. Lett. 81, No. 5, 265--270 (2002; Zbl 1053.68107) Full Text: DOI
Bhattacharya, Binay K.; Das, Gautam; Mukhopadhyay, Asish; Narasimhan, Giri Optimally computing a shortest weakly visible line segment inside a simple polygon. (English) Zbl 1003.65013 Comput. Geom. 23, No. 1, 1-29 (2002). Reviewer: Clara I.Grima (Seville) MSC: 65D18 68U05 PDFBibTeX XMLCite \textit{B. K. Bhattacharya} et al., Comput. Geom. 23, No. 1, 1--29 (2002; Zbl 1003.65013) Full Text: DOI
Suzuki, Ichiro; Tazoe, Yuichi; Yamashita, Masafumi; Kameda, Tiko Searching a polygonal region from the boundary. (English) Zbl 1074.68654 Int. J. Comput. Geom. Appl. 11, No. 5, 529-553 (2001). MSC: 68U05 52B55 PDFBibTeX XMLCite \textit{I. Suzuki} et al., Int. J. Comput. Geom. Appl. 11, No. 5, 529--553 (2001; Zbl 1074.68654) Full Text: DOI
Lee, Jae-Ha; Park, Sang-Min; Chwa, Kyung-Yong Searching a polygonal room with one door by a 1-searcher. (English) Zbl 1074.68642 Int. J. Comput. Geom. Appl. 10, No. 2, 201-220 (2000). MSC: 68U05 52B55 68Q17 PDFBibTeX XMLCite \textit{J.-H. Lee} et al., Int. J. Comput. Geom. Appl. 10, No. 2, 201--220 (2000; Zbl 1074.68642) Full Text: DOI
Tan, Xuehou Edge guards in straight walkable polygons. (English) Zbl 1020.52008 Int. J. Comput. Geom. Appl. 9, No. 1, 63-79 (1999). MSC: 52B05 52C10 65D18 PDFBibTeX XMLCite \textit{X. Tan}, Int. J. Comput. Geom. Appl. 9, No. 1, 63--79 (1999; Zbl 1020.52008) Full Text: DOI
Das, Gautam; Heffernan, Paul J.; Narasimhan, Giri LR-visibility in polygons. (English) Zbl 0869.68106 Comput. Geom. 7, No. 1-2, 37-57 (1997). MSC: 68U05 PDFBibTeX XMLCite \textit{G. Das} et al., Comput. Geom. 7, No. 1--2, 37--57 (1997; Zbl 0869.68106) Full Text: DOI
Narasimhan, Giri On Hamiltonian triangulations in simple polygons (extended abstract). (English) Zbl 1497.68536 Dehne, Frank (ed.) et al., Algorithms and data structures. 5th international workshop, WADS ’97, Halifax, Nova Scotia, Canada, August 6–8, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1272, 321-330 (1997). MSC: 68U05 05C45 68R10 PDFBibTeX XMLCite \textit{G. Narasimhan}, Lect. Notes Comput. Sci. 1272, 321--330 (1997; Zbl 1497.68536) Full Text: DOI
Das, Gautam; Heffernan, Paul J.; Narasimhan, Giri Finding all weakly-visible chords of a polygon in linear time (extended abstract). (English) Zbl 1502.68310 Schmidt, Erik M. (ed.) et al., Algorithm theory – SWAT ’94. 4th Scandinavian workshop on algorithm theory, Aarhus, Denmark, July 6–8, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 824, 119-130 (1994). MSC: 68U05 PDFBibTeX XMLCite \textit{G. Das} et al., Lect. Notes Comput. Sci. 824, 119--130 (1994; Zbl 1502.68310) Full Text: DOI
Liaw, Bern-Cherng; Lee, R. C. T. An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons. (English) Zbl 0942.68740 Inf. Process. Lett. 52, No. 2, 69-75 (1994). MSC: 68U05 68Q25 68W05 PDFBibTeX XMLCite \textit{B.-C. Liaw} and \textit{R. C. T. Lee}, Inf. Process. Lett. 52, No. 2, 69--75 (1994; Zbl 0942.68740) Full Text: DOI