A partial list of citations

1. F. Aurenhammer, R. Klein and D T Lee, Voronoi Diagrams and Delaunay Triangulations, World Scientific, Singapore, 2013.

2. M. de Berg, M. Van Kreveld, M. Overmars and O. Schwarzkopf, Computational Geometry: Algorithms and Applications, Springer, 1997.

3. M. Brazil and M. Zachariasen, Optimal Interconnection Trees in the Plane, Springer International Publishing, 2015.

4. F Bullo, J Cortes and S Martinez, Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms, Princeton University Press, 2009.

5. K. Klamroth, Single-Facility Location Problems with Barriers, Springer-Verlag, 2002.

6. J-C Latombe, Robot Motion Planning, Kluwer Academic Publishers, 1991.

7. S. M. LaValle, Planning Algorithms, Cambridge University Press, 2006.

8. F. Li and R. Klette, Euclidean Shortest Paths: Exact or Approximate Algorithms, Springer, 2011.

9. F. M. Malley, Single-layer wire routing and compaction, MIT Press, 1990.

10. J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, 1987.

11. J. O'Rourke, Computational Geometry in C, Cambridge University Press, 1994 (Second Edition in 1998).

12. J. P. Spinrad, Efficient Graph Representations, American Mathematical Society, 2003.

In handbooks:

13. M. J. Atallah and D. Z. Chen, Deterministic parallel computational geometry, Handbook of Computational Geometry (Ed. J.-R. Sack and J. Urrutia), Elsevier Science, Amsterdam, Chapter 4, pp. 155-200, 2000.

14. L. de Floriani, P. Magillo and E. Puppo, Applications to computational geometry to geographic information systems, Handbook of Computational Geometry (Ed. J.-R. Sack and J. Urrutia), Elsevier Science, Amsterdam, Chapter 7, pp. 333-388, 2000.

15. M. T. Goodrich, Parallel algorithms in geometry, Handbook of Discrete and Computational Geometry (Ed. J. E. Goodman and J. O'Rourke), CRC Press, Florida, Chapter 36, pp. 953-967, 2004.

16. M. Keil, Polygon Decomposition, Handbook of Computational Geometry (Ed. J.-R. Sack and J. Urrutia), Elsevier Science, Amsterdam, Chapter 11, pp. 491-518, 2000.

17. D. T. Lee, Computational geometry, The Computer Science and Engineering Handbook (Ed. A. Tucker), CRC Press, Florida, Chapter 6, pp. 111-135, 1996.

18. D. T. Lee, Computational geometry II, Handbook on Algorithms and Theory of Computation (Ed. M. Atallah), CRC Press, Florida, Chapter 20, 1998.

19. A. Maheshwari, J.-R. Sack and D. Djidjev, Link Distance Problems, Handbook of Computational Geometry (Ed. J.-R. Sack and J. Urrutia), Elsevier Science, Amsterdam, Chapter 12, pp. 519-558, 2000.

20. J. B. Mitchell, Geometric shortest paths and network optimization, Handbook of Computational Geometry (Ed. J.-R. Sack and J. Urrutia), Elsevier Science, Amsterdam, Chapter 15, pp. 633-702, 2000.

21. J. B. Mitchell, Shortest paths and networks, Handbook of Discrete and Computational Geometry (Ed. J. E. Goodman and J. O'Rourke), CRC Press, Florida, Chapter 27, pp. 607-641, 2004.

22. J. O'Rourke, Visibility, Handbook of Discrete and Computational Geometry (Ed. J. E. Goodman and J. O'Rourke), CRC Press, Florida, Chapter 25, pp. 643-663, 2004.

23. J. O'Rourke and S. Suri, Polygons, Handbook of Discrete and Computational Geometry (Ed. J. E. Goodman and J. O'Rourke), CRC Press, Florida, Chapter 23, pp. 583-606, 2004.

24. J. Urrutia, Art Gallery and illumination problems, Handbook of Computational Geometry (Ed. J.-R. Sack and J. Urrutia), Elsevier Science, Amsterdam, Chapter 22, pp. 973-1027, 1999.

25. F. F. Yao, Computational geometry, Handbook of Theoretical Computer Science (Ed. J. van Leeuwen), Vol A: Algorithms and Complexity, The MIT Press/Elsevier, Chapter 7, pp. 343-390, 1990.

In review papers:

26. H. Alt and E. Welzl, Visibility graphs and obstacle-avoiding shortest paths, Zor-Zeitschrift fur Operation Research, vol. 32, pp. 145-164, 1988.

27. F. Aurenhammer and Y.-F. Xu, Optimal triangulations, Encyclopedia of Optimization (P. Pardalos and C. Floudas, Eds.), vol. 15, pp. 2757-2764, Springer, 2009.

28. F. Brandenburg, D. Eppstein, M. T. Goodrich, S. Kobourov, G. Liotta, and P. Mutzel, Selected open problems in graph drawing, Proceeding of International Symposium on Graph Drawing, Lecture Notes in Computer Science, Springer-Verlag, no. 2912, pp. 515-539, 2004.

29. M. Bern and D. Eppstein, Mesh generation and optimal triangulation, In Computing in Euclidean Geometry, vol. 1 of Lecture Notes Series on Computing. World Scientific, Singapore (D.-Z. Du and F. K. Hwang, Eds.), pp. 23-90, 1992.

30. M. Brazil and M. Zachariasen, Steiner trees with other cost functions and constraints, In Optimal Interconnection Trees in the Plane, pp. 219-299, Springer International Publishing, 2015.

31. J. Cardinal, Computational Geometry Column 62, ACM SIGACT News, vol. 46, no. 4, pp. 69-78, 2015.

32. Danny Z. Chen, Developing algorithms and software for geometric path planning problems, ACM Computing Surveys (Electronic Section), vol. 28, no. 4es, Article 18, 1996.

33. Fredo Durand, A multidisciplinary survey of visibility, ACM Siggraph course notes Visibility, Problems, Techniques, and Applications, pp. 1-145, July 2000.

34. R. Fleischer, O. Fries, K. Mehlhorn, S. Meiser, S. Naher, H. Rohnert, S. Schirra, K. Simon, A. Tsakalidis and C. Uhrig, Selected topics from computational geometry: Data structures and motion planning, Proceeding of Data Structures and Efficient Algorithms, Lecture Notes in Computer Science, Springer-Verlag, no. 594, pp. 25-43, 1992.

35. F. Hurtado and C. D. Toth, Plane geometric graph augmentation: A generic perspective, Thirty Essays on Geometric Graph Theory (J. Pach, editor), Springer, pp. 327-354, 2013.

36. C. Icking and R. Klein, Competitive strategies for autonomous systems, In Modelling and Planning for Sensor Based Intelligent Robot Systems (H. Bunke. et al., editor), World Scientific, Singapore, pp. 23-40, 1995.

37. D. T. Lee, Computational geometry, ACM Computing Surveys, vol. 28, pp. 27--31, 1996.

38. J. O'Rourke, Computational geometry column 3, ACM SIGACT News, vol. 18, pp. 13-15, 1987.

39. J. O'Rourke, Computational geometry, Annual Review of Computer Science, vol. 3, pp. 389-411, 1988.

40. J. O'Rourke, Computational geometry column 18, ACM SIGACT News, vol. 24, pp. 20-25, 1993.

41. J. O'Rourke, Computational geometry column 24, ACM SIGACT News, vol. 25, pp. 12-14, 1994.

42. J. O'Rourke, Computational geometry column 29, International Journal of Computational Geometry and Applications, vol. 6, pp. 507-511, 1996.

43. J. O'Rourke, Open problems in the combinatorics of visibility and illumination, Advances in Discrete and Computational Geometry, Contemporary Mathematics (B. Chazelle, J. E. Goodman and R. Pollack Eds.), American Mathematical Society, pp. 237-243, 1998.

44. J.F. Peters, Visibility, hausdorffness, algebra and separation spaces, In Computational Proximity, pp. 175-213, Springer International Publishing, 2016.

45. A. Sforza, S. Starita and C. Sterle, Optimal location of security devices, Railway Infrastructure Security (R. Setola, A. Sforza, V. Vittorini and C. Pragliola Eds.), vol. 27, pp 171-196, 2015.

46. T. Shermer, Recent results in art galleries, Proc. of the IEEE, vol. 80, no. 9, pp. 1384-1399, 1992.

47. E.G. Tsardoulias, A. Iliakopoulou, A. Kargakos, and L. Petrou, A review of global path planning methods for occupancy grid maps regardless of obstacle density, Journal of Intelligent and Robotic Systems, pp. 1-30, 2016.

In theses:

48. F. Abu-dakka, Trajectory planning for industrial robot using genetic algorithms, Ph. D. thesis, Universitat Polit`cnica de Val`ncia, 2011.

49. B. Adler, System design and real-time guidance of an unmanned aerial vehicle for autonomous exploration of outdoor environments, Ph.D. thesis, University of Hamburg, 2014.

50. I. Apostolopoulos, Integrating minimalistic localization and navigation for people with visual impairments, MS thesis, University of Nevada, 2011.

51. D. Archambault, All the distance horizon edges of a terrain, MS. thesis, University of British Columbia, 2003.

52. S. Bahun, Algorithms for optimizing search schedules in a polygon, MS thesis, University of Waterloo, 2008.

53. N. Basilico, Navigation strategies for exploration and patrolling with autonomous mobile robots , Ph. D. thesis, Politecnico di Milano, 2010.

54. S. Basu-Roy, Computing best coverage path in the presence of obstacles in wireless sensor networks, MS thesis, University of Texas, Arlington, 2007.

55. M. Bell, Flexible object manipulation, Ph. D. thesis, Dartmouth College, 2010.

56. P. Belleville, A study of convex covers in two or more dimensions}, Ph. D. thesis, Simon Fraser University, 1995.

57. B. Ben-Moshe, Geometric facility location optimization, Ph. D. thesis, Ben-Gurion University, 2005.

58. S. Bhattacharjee, A primal-dual algorithm for the maximum charge problem with capacity constraints, MS thesis, University of Lethbridge, 2010.

59. N. S. Bidokhi, On fully characterizing terrain visibility graphs, MS thesis, University of British Columbia, 2012.

60. J. Bittner, Hierarchical techniques for visibility computations, Ph. D. thesis, Czech Technical University, 2002.

61. P. Bose, Geometric and computational aspect of manufacturing process, Ph. D. thesis, McGill University, 1994

62. J.-S. Boulanger, Interest management for massively multiplayers games, MS thesis, McGill University, 2006.

63. D. D. Bremner, Point visibility graphs and restricted-orientation polygon covering}, MS thesis, University of Calgary, 1990.

64. B. Chan, A primal-dual algorithm for the unconstrained fractional matching problem, MS thesis, Simon Fraser University, 2009.

65. D. Chen, Parallel techniques for path visibility and related problems, Ph. D. thesis, Purdue University, 1992.

66. J.-S. Chenong, Strip decomposition of polygons, M. Phil. thesis, Hong Kong University of Science and Technology, 2000.

67. Y. J. Chiang, Dynamic and I/O-efficient algorithms for computational geometry and graph poblems: Theoretical and experiment results, Ph. D. thesis, Brown University, 1995.

68. H. R. Chitsaz, Geodesic problems for mobile robots, Ph. D. thesis, University of Illinois at Urbana-Champaign, 2008.

69. B. Coleman, Finding a nonredundant component in a polygon, MS thesis, Simon Fraser University, 2011.

70. F. Contreras, Cutting polygons and a problem on illumination of stages, MS thesis, University of Ottawa, 1998.

71. L. Dale, Optimization techniques for probabilistic roadmaps, Ph. D. thesis, Texas A\&M University, 2000.

72. G. Das, Approximation schemes in computational geometry, Ph. D. thesis, University of Wisconsin-Madison, 1990.

73. J. D. Delaney, Latency reduction in distributed interactive applications using hybrid strategy-based models}, Ph. D. thesis, National University of Ireland, 2005.

74. A. Deshpande, A pseudo-polynomial time $O(log^2 n)$-approximation algorithm for art gallery problems, MS. thesis, Massachusetts Institute of Technology, 2006.

75. Y. Disser, Mapping polygons, Ph.D. thesis, ETH Zurich, 2011.

76. F. Durand, 3D Visibility: Analytical study and Applications, Ph. D. thesis, Universit Joseph Fourier, Grenoble, France, July 1999.

77. S. Eidenbenz, (In-)Approximability of visibility problems on polygons and terrains, Ph. D. thesis, Institute for Theoretical Computer Science, ETH, 2000.

78. L. Erickson, Visibility analysis of landmark-based navigation, Ph. D. thesis, University of Illinois at Urbana-Champaign, 2014.

79. H. Everett, Visibility graph recognition, Ph. D. thesis, University of Toronto, 1990.

80. L. Gewali, Efficient algorithms for path planning and visibility problems , Ph. D. thesis, University of Texas, Dallas, 1989.

81. S. Ghali, A Geometric framework for computer graphics addressing modeling, visibility, and shadows, Ph. D. thesis, University of Toronto, 1999.

82. M. Hagedoorn, Pattern matching using similarity measures, Ph. D. thesis, Universiteit Utrecht, 2000.

83. Y. Higashikawa, Studies on the space exploration and the sink location under incomplete informa- tion towards applications to evacuation planning , Ph. D. thesis, Kyoto University, 2014.

84. M. Hoffmann, On the Existence of Paths and Cycles, Ph. D. thesis, Institute for Theoretical Computer Science, ETH, 2005.

85. R. Inkulu, Algorithms for shortest paths and visibility polygons in R2, Ph. D. thesis, Illinois Institute of Technology, 2007.

86. M. Ishaque, Geometric data structures, Ph. D. thesis, Tufts University, 2010.

87. I. V. Isler, Algorithms for distributed and mobile sensing, Ph. D. thesis, University of Pennsylvania, 2004.

88. L. E. Jackson, Polygon reconstruction from visibility information, Master thesis, University of Lethbridge, 1996.

89. C. Jones, Triangle intersection graphs and visibility graphs, Ph. D. thesis, Washington State University, 1993.

90. J. King, Guarding problems and geometric split trees, Ph. D. thesis, McGill University, 2010.

91. A. Koch, Representations of Graphs by Outside Obstacles, Ph. D. thesis, University of Karlsruhe, 2012.

92. E. A. Krohn, Urveilling roads and protecting art, Ph. D. thesis, The University of Iowa, 2009.

93. S. M. Lavalle, A game-theoretic framework for robot motion planning, Ph. D. thesis, University of Illinois at Urbana-Champaign, 1995.

94. T. Kavitha, Algorithms for computing paths of bounded curvature in a polygon, Ph. D. thesis, Tata Institute of Fundamental Research, 2002.

95. G. Macdonald, Isomorphism and layout of spiral polygons, MS thesis, Simon Fraser University, 1993.

96. A. M. Martins, Geometric optimization on visibility problems: Metaheuristic and exact solutions, Ph. D. thesis, Universidade de Aveiro, 2009.

97. A. Maheshwari, Parallel algorithms for minimum link paths and related problems, Ph. D. thesis, Tata Institute of Fundamental Research, India, 1992.

98. B. S. Mengisteab, Single-crossing orthogonal axial lines in orthogonal rectangles, MS thesis, University of the Witwatersrand, 2007.

99. G. Morgenstern, Covering Geometric Domains, Ph. D. thesis, Ben-Gurion University of the Negev, 2011.

100. P. Mitra, Rectilinear shortest paths among obstacles in the plane}, Ph. D. thesis, Simon Fraser University, 1995.

101. S. Nandy, Studies on some geometric algorithms with application to VLSI, Ph. D. thesis, Indian Statistical Institute, India, 1994.

102. A. Nash, Any-angle path planning, Ph. D. thesis, Unibersity of Southern California, 2012

103. S. Nirenstein, Fast and accurate visibility preprocessing, Ph. D. thesis, University of Cape Town, 2003.

104. M. T. Omran, Path problems in geographic information systems, Ph. D. thesis, Carleton Univer- sity, 2014.

105. S. Pal, Weak visibility and related problems on simple polygons, Ph. D. thesis, Indian Institute of Science, India, 1990.

106. D. Pajak, Algorithms for deterministic parallel graph exploration , Ph. D. thesis, Laboratoire Bordelais de Recherche en Informatique, 2014.

107. R Penninger, Dilation, transport, visibility and fault-tolerant algorithms , Ph. D. thesis, University of Bonn, 2014.

108. C. D. Piatko, Geometric bicriteria optimal path problems, Ph. D. thesis, Cornell University, 1993.

109. I. Reinbacher, Geometric algorithms for delineating geographic regions, Ph. D. thesis, Universiteit Utrecht, 2006.

110. M. Romauch, Facility location and related problems, Ph. D. thesis, University of Wien, 2007.

111. C. Schmidt, Algorithms for mobile agents with limited capabilities, Ph. D. thesis, Braunschweig Institute of Technology and Cuvillier, 2011.

112. Y. Schreiber, Euclidean shortest paths on polyhedra in three dimensions, Ph. D. Thesis, Tel Aviv University, 2007.

113. H. Shaul, Range searching: emptiness, reporting, and approximate counting, Ph. D. thesis, Tel Aviv University, 2011.

114. W. Si, Applying geometric routing to wirless mesh networks, Ph. D. thesis, The University of Sydney, 2010.

115. S. Teramoto, Randomness and hardness in geometric computing problems, Ph. D. thesis, Japan Advanced Institute of Science and Technology, 2007.

116. P. Tokekar, Placement and motion planning algorithms for robotic sensing systems, Ph. D. thesis, University of Minnesota, 2014.

117. G. Varadhan, Accurate sampling-based algorithms for surface extraction and motion planning, Ph. D. thesis, University of North Carolina, 2005.

118. E. Vicari, On locality and related problems: communicating, computing, exploring, Ph. D. thesis, Institute for Theoretical Computer Science, ETH, 2008.

119. P. Wang, View planning with combined view and travel cost, Ph. D. thesis, Simon Fraser University, 2007.

120. R. Wein, The integration of exact arrangements with effective motion planning, Ph. D. thesis, Tel-Aviv University, 2007.

121. D. T. Wooden, Graph-based path planning for mobile robots, Ph. D. thesis, Georgia Institute of Technology, 2006.

122. H. Xiao, Kinetic Visibility, Ph. D. thesis, Queen's University, 2007.

123. J. Z. Zhang, Applications of visibility space in polygon search problems, Ph. D. thesis, Simon Fraser University, 2005.

124. L. Zhang, On the three-dimensional visibility skeleton:implementation and analysis, Ph. D. thesis, McGill University, 2009.

125. Z. Zhang, Recognition and searching of one-sided rectilinear polygons, MS thesis, Saskatchewan University, 2008.

In papers:

126. M. Aanjaneya, A. Bishnu and S. P. Pal, Directly visible pairs and illumination by reflections in orthogonal polygons, Proceedings of the 24th European Workshop on Computational Geometry, Nancy, pp. 241-244, 2008.

127. A. Abdullah, Bottlenecks identification in general junction, Proceedings of the Canadian Conference on Computational Geometry, pp. 26-28, 1991.

128. M. Abellanas, E. Alba, S. Canales and G. Hernandez, Solving the illumination problem with heuristics, Proceedings of the 6th International Conference on Numerical Methods and Applications, Lecture Notes in Computer Science, Springer-Verlag, no. 4310, pp. 205-213, 2007.

129. M. Abellanas, A. Bajuelos and I. Matos, Some problems related to good illumination, Proceedings of the International Conference on Computational Science and Its Applications (Part I), Lecture Notes in Computer Science, Springer-Verlag, no. 4705, pp. 1-14, 2007.

130. M. Abellanas, G. Hernandez, A. Bajuelos, I. Matos and B. Palop, The embracing Voronoi diagram and closest embracing, Journal of Mathematical Sciences, vol. 161, no. 6, pp. 909-918, 2009.

131. J. Abello and O. Egecioglu, Visibility graphs of staircase polygons with uniform step length, Discrete and Computational Geometry, vol. 3, pp. 27-37, 1993.

132. J. Abello, O. Egecioglu and K. Kumar, Visibility graphs of staircase polygons and the weak Bruhat order I: from visibility graphs to maximal chains, Discrete and Computational Geometry, vol. 14, no. 3, pp. 331-358, 1995.

133. J. Abello and E. Gansner, Short and smooth polygonal paths, Proceedings of the third Latin American Theoretical Informatics Symposium, Lecture Notes in Computer Science, Springer-Verlag, no. 1380, pp. 151-162, 1998.

134. J. Abello and K. Kumar, Visibility graphs and oriented metroids, Proceeding of Graph Drawing, Lecture Notes in Computer Science, Springer-Verlag, no. 894, pp. 147-158, 1995.

135. J. Abello and K. Kumar, Visibility graphs of 2-spiral polygons, Proceedings of LATIN '95: Theoretical Informatics, Lecture Notes in Computer Science, Springer, no. 911, pp. 1-15, 1995.

136. J. Abello, H. Lin and S. Pisupati, On visibility graphs of simple polygons, Congressus Numeratium, vol. 90, 119-128, 1992.

137. L. Addario-Berry, O. Amini, J-S. Sereni, and S. Thomasse, Guarding art galleries: The extra cost for sculptures is linear, Proceedings of the 11th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Springer, no. 5124, pp. 41-52, 2008.

138. F. Adiceam, How far can you see in a forest?, International Mathematics Research Notices, pp. 292, 2015.

139. J. Adegeest, M. Overmars and J. Snoeyink, Minimum-link c-oriented paths: single-source queries, International Journal of Computational Geometry and Applications, vol. 4, no. 1, pp. 39-51, 1994.

140. A. Agarwal, L. Meng-Hiot and E. Joo, A VoMVi complex for supporting optimal path queries for UAVs, Proceedings of the 2nd International Conference on Voronoi Diagram in Science and Engineering, pp. 1-6, 2005.

141. P. K. Agarwal, N. Alon, B. Arnov and S. Suri, Can visibility graphs be represented compactly?, Discrete and Computational Geometry, vol. 12, pp. 347-365, 1994.

142. O. Aichholzer, G. Aloupis, E. D. Demaine, M. L. Demaine, V. Dujmovic, F. Hurtado, A. Lubiw, G. Rote, A. Schulz, D. L. Souvaine and A. Winslow, Convexifying polygons without losing visibilities, Proceedings of the Canadian Conference on Computational Geometry, 2011.

143. Z. Algfoor, M. Sunar, and H. Kolivand, A Comprehensive Study on Pathfinding Techniques for Robotics and Video Games, International Journal of Computer Games Technology, vol. 2015, pp.1-11, 2015.

144. S. Alipour and A. Zarei, Visibility testing and counting, Proceedings of Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, Lecture Notes in Computer Science, Springer, no. 6681, pp. 343-351, 2011.

145. S. Alipour, M. Ghodsi, A. Zarei, and M. Pourreza, Visibility testing and counting, Information Processing Letters, vol. 115, no. 9, pp. 649-654, 2015.

146. A. Altahir, V.S. Asirvadam, N.H.B Hamid, and P. Sebastian, Secondary coverage configuration to support surveillance monitoring, Proceedings of IEEE 11th International Colloquium on Signal Processing and Its Applications (CSPA), pp. 121-126, 2015.

147. A. A. Altahir, V. S. Asirvadam, N. H. B. Hamid, P. Sebastian, N. B. Saad, R. B. Ibrahim, and S. C. Dass, Optimizing visual surveillance sensor coverage using dynamic programming, IEEE Sensors Journal, vol. 17(11), pp. 3398-3405, 2017.

148. M. Alsuwaiyel and D. T. Lee, Finding an approximate minimum-link visibility path inside a simple polygon, Information Processing Letters, vol. 55, no. 2, pp. 75-79, 1995.

149. V. Alvarez, Parity-constrained triangulations with steiner points , Graphs and Combinatorics, vol. 31, no. 1, pp. 35-57, 2015.

150. Y. Amit, J. S. B. Mitchell, E. Packer, Locating guards for visibility coverage of polygons, Proceedings of the Workshop on Algorithm Engineering and Experiments, pp. 1-15, 2007.

151. P. Angelier and M. Pocchiola, A sum of squares theorem for visibility complexes, Proceedings of the ACM Symposium on Computational Geometry, pp. 302-311, 2001.

152. I. Ardiyanto and J. Miura, Visibility-based viewpoint planning for guard robot using skeletonization and geodesic motion model, Proceedings of IEEE International Conference on Robotics and Automation, pp. 660-666, 2013.

153. E. Arkin, R. Connelly and J. Mitchell, On monotone paths among obstacles, with applications to planning assemblies, Proceedings of the ACM Symposium on Computational Geometry, pp. 334-343, 1989.

154. E.M. Arkin, A. Efrat, C. Knauer, J.S. Mitchell, V. Polishchuk, G. Rote, L. Schlipf, and T. Talvitie, Shortest path to a segment and quickest visibility queries, Journal of Computational Geometry, vol. 7, no. 2, pp. 77-100, 2016.

155. E. Arkin, S. Khuller and J. Mitchell, Geometric knapsack problems, Algorithmica, vol. 10, pp. 399-427, 1993.

156. E. Arkin, J. Mitchell and C. D. Piatko, Bicriteria shortest path problems in the plane, Proceedings of the Canadian Conference on Computational Geometry, pp. 153-156, 1991.

157. E. Arkin, J. Mitchell and C. Piatko, Minimum-link watchman tours, Information Processing Letters, vol. 86, pp. 203-207, 2003.

158. E. Arkin, J. Mitchell and S. Suri, Logarithmic-time link path queries in a simple polygon, International Journal of Computational Geometry and Applications, vol. 5, no. 4, pp. 369-395, 1995.

159. B. Arnov, A. R. Davis, J. Iacono and A. S. C. Yu, The complexity of diffuse reflections in a simple polygon, Proceedings of the 7th International Symposium of Latin American Theoretical Informatics, Lecture Notes in Computer Science, Springer-Verlag, no. 3887, pp. 93-104, 2006.

160. B. Arnov, L. Guibas, M. Teichmann and L. Zhang, Visibility queries and maintenance in simple polygon, Discrete and Computational Geometry, vol. 27, pp. 461-483, 2002.

161. R. Aschner, M. J. Katz, G. Morgenstern and Y. Yuditsky, Approximation schemes for covering and packing<\I>, Proceedings of the 7th International Workshop on Algorithms and Computations, Lecture Notes in Computer Science, Springer, vol. 7748, pp. 89-100, 2013.

162. P. Ashok, F. V. Fomin, S. Kolay, S. Saurabh, and M. Zehavi, Exact algorithms for terrain guarding, In LIPIcs-Leibniz International Proceedings in Informatics, vol. 77, Schloss Dagstuhl-Leibniz- Zentrum fuer Informatik, 2017.

163. C. Au and Y. Ma, Computation of the Shortest Path in a Bounded Domain With Free Form Boundary by Domain Partitioning, Journal of Computing and Information Science in Engineering, vol. 14, no. 2, pp. 1-11, 2014.

164. A. Bajuelos, S. Canales, G. Hernández, A. Martins, Minimum Vertex Guard problem for orthogonal polygons: a genetic approach, In Proceedings of 10th WSEAS International Conference on Mathematical Methods, Computational Techniques and Intelligent Systems, pp. 78-84, 2008.

165. A. Bajuelos, S. Canales, G. Hernández, A. Martins, Estimating the maximum hidden vertex set in polygons, Proceedings of the International Conference on Computational Sciences and Its Applications, IEEE-CS Press, pp. 421-432, 2008.

166. A. Bajuelos, S. Canales, G. Hernández, A. Martins, Optimizing the Minimum Vertex Guard Set on Simple Polygons via a Genetic Algorithm, in WSEAS Transactions in Information Science and Applications, vol 5, no. 11, pp. 1584-1596, 2008.

167. A. Bajuelos, G. Hernández, I. Matos, Good illumination with limited visibility, Proceedings of the International Conference on Numerical Analysis and Applied Mathematics, Wiley-VCH, pp. 35-38, 2005.

168. A. Bajuelos, A. Martins, S. Canales and G. Hernández, Metaheuristic Approaches for the Minimum Vertex Guard Problem, Proceedings of the Third International Conference on Advanced Engineering Computing and Applications in Sciences, pp. 77-82, 2009.

169. A. Bajuelos, A. Martins, S. Canales and G. Hernández, Metaheuristic Approaches for the Minimum Vertex Guard Problem, Proceedings of the Third International Conference on Advanced Engineering Computing and Applications in Sciences, pp. 77-82, 2009.

170. A. Balstan and M. Sharir, On the shortest paths between two convex polyhedra, Journal of the ACM, vol. 35, pp. 267 - 287, 1988.

171. L. Barba, M. Korman, S. Langerman, K. Sadakane and R. I. Silveira, Spacetime trade-offs for stack-based algorithms, Algorithmica, vol. 72, no. 4, pp. 1097-1129, 2015.

172. L. Barba, M. Korman, S. Langerman and R. I. Silveira, Computing the visibility polygon using few variables, Proceedings of the 22nd International Symposium on Algorithms and Computations, Lecture Notes in Computer Science, Springer, no. 7074, pp. 70-79, 2011.

173. L. Barba, M. Korman, S. Langerman and R. I. Silveira, Computing a visibility polygon using few variables, Computational Geometry: Theory and Applications, vol. 47, pp. 918-926, 2014.

174. G. Barequet, S. M. Cannon, E. Fox-Epstein, B. Hescott and D. L. Souvaine, C. D. Toth and A. Winslow, Diffuse Reflections in Simple Polygons, Electronic Notes in Discrete Mathematics, vol. 44, pp. 345-350, 2013.

175. G. Barequet, S. M. Cannon, E. Fox-Epstein, B. Hescott and D. L. Souvaine, C. D. Toth and A. Winslow, Diffuse Reflections diameter in simple polygons, Discrete Applied Mathematics, vol. 210, pp. 123-132, 2016.

176. A Bartschi and F. Grandoni, On Conflict-free multi-coloring, In Proceedings of Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Springer, no. 9214, pp. 103-114, 2015.

177. S. Basu-Roy, G. Das and S. Das, Computing best coverage path in the presence of obstacles in a sensor field, Proceedings of the 10th International Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Springer-Verlag, no. 4619, pp. 577-588, 2007.

178. S. Basu-Roy, G. Das and S. Das, Algorithms for computing best coverage path in the presence of obstacles in a sensor field, Journal of Discrete Algorithms, vol. 13, pp. 86-97, 2012.

179. B. Ben-Moshe, O. Hall-Holt, M. Katz and J. Mitchell, Computing the visibility graph of points within a polygon, Proceedings of the ACM Symposium on Computational Geometry, pp. 27-35, 2004.

180. B. Ben-Moshe, M. Katz and J. Mitchell, A constant-factor approximation algorithm for optimal terrain guarding, SIAM Journal on Computing, vol. 36, pp. 1631-1647, 2007.

181. M. Bell and D. Balkcom, Grasping non-stretchable cloth polygons, International Journal of Robotics Research, Electronic publication, 2009.

182. K. B'rczi, P. Csikv'ri, E. R. Kov'cs and L. A. Ve'gh, Splitting property via shadow systems, Proceedings of the 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Appli- cations, pp. 33, 2013.

183. S. Bereg and D. Kirkpatrick, Curvature-bounded traversals of narrow corridors, Proceedings of the ACM Symposium on Computational Geometry, pp. 278-287, 2005.

184. M. Berg, S. Durocher and S. Mehrabi, Guarding monotone art galleries with sliding cameras in linear time, Proceedings of the 8th International Conference on Combinatorial Optimization and Applications, Lecture Notes in Computer Science, Springer, no. 8881, pp. 113-125, 2014.

185. M. Berg, M.Groot and M. Overmars, Perfect binary space partitions, Computational Geometry: Theory and Applications, vol. 7, pp. 81-91, 1997.

186. M. Berg, M.Groot and M. Overmars, Perfect binary space partitions, Computational Geometry: Theory and Applications, vol. 7, pp. 81-91, 1997.

187. M. Berg and M. Overmars, Dominance in the presence of obstacles, Proceedings of the Conference on Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Springer-Verlag, no. 344, pp. 190-201, 1988.

188. S. Bespamyatnikh, Encoding homotopy of paths in the plane, Proceedings of the 6th Latin American Theoretical Informatics Symposium, Lecture Notes in Computer Science, Springer-Verlag, no. 2976, pp. 329-338, 2004.

189. J. Bhadury and R. Chandrasekaran, Stock cutting of complicated designs by computing minimal nested polygons, Engineering Optimization, vol. 25, pp. 165-178, 1995.

190. J. Bhadury and R. Chandrasekaran, Finding the set of all minimal nested convex polygons, Proceedings of the Canadian Conference on Computational Geometry, pp. 26-31, 1996.

191. B. Bhattacharya and A. Mukhopadhyay, Computing a linear time a chord from which a simple polygon is weakly internally visible, Proceeding of the Conference on Algorithms and Computations, Lecture Notes in Computer Science, Springer Verlag, no. 1004, pp. 22-31, 1995.

192. B. Bhattacharya, A. Mukhopadhyay and G. Narasimhan, Optimal algorithms for two-guard walkability of simple polygons, Proceeding of the Conference on Algorithms and Data Structures, Lecture Notes in Computer Science, Springer Verlag, no. 1004, pp. 22-31, 2001.

193. B. Bhattacharya, T. Kameda and J. Z. Zhang, Surveillance of a polygonal area by a mobile searcher from the boundary: Searchability testing, Proceedings of IEEE International Conference on Robotics and Automation, pp. 2461-2466, 2009.

194. B. Bhattacharya, J. Z. Zhang, Q. Shi and T. Kameda, An optimal solution to room search problem, Proceedings of the 18th Annual Canadian Conference on Computational Geometry, pp. 55-58, 2006.

195. P. Bhattacharya and M. L. Gavrilova, Voronoi diagram in optimal path planning, Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, pp. 38-47, 2007.

196. P. Bhattacharya and M. L. Gavrilova, Roadmap-based path planning - using the Voronoi diagram for a clearance-based shortest path, IEEE Robotics and Automation Magazine, vol. 15, no. 2, pp. 58-66, 2008.

197. P. Bhattacharya and M. L. Gavrilova, Density-based clustering based on topological properties of the data set, Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence (Ed. M. L. Gavrilova), vol. 158, pp. 197-214, 2009.

198. T. Biedl, G. Kant and H. Kaufmann, On triangulating planar graphs under the four-connected constraint, Algorithmica, vol. 19, pp. 427-446, 1997.

199. T. Biedl, M. T. Irfan, J. Iwerks, J. Kim and J. Mitchell, Gurding polyominoes, Proceedings of the 27th annual ACM Symposium on Computational Geometry, pp. 387-396, 2011.

200. T. Biedl, M. T. Irfan, J. Iwerks, J. Kim and J. Mitchell, The art gallery theorem for polyominoes, Discrete and Computational Geometry, vol. 48, pp. 711-720, 2012.

201. D. Bilo, Y. Disser, M. Mihalak, S. Suri, E. Vicari and P. Widmayer, Reconstructing visibility graphs with simple robots, Theoretical Computer Science, vol. 444, pp. 52-59, 2012.

202. S. Biswas, D. C. Prasad and S. P. Pal, Algorithms convex visible polygons, Proceedings of Foundation of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Springer, no. 880, pp. 181-192, 1994.

203. S. Biswas, D. C. Prasad and S. P. Pal, Recognizing weakly convex visible polygons, Computational Geometry: Theory and Applications, vol. 10, no. 3, pp. 171-186, 1998.

204. P. Bose and P. Morin, Online routing in triangulations, SIAM Journal on Computing, vol. 33, pp. 937-951, 2004.

205. P. Bose and G. T. Toussaint, Geometric and computational aspects of manufacturing processes, Computer & Graphics, vol. 18, pp. 487-497, 1994.

206. P. Bose and G. T. Toussaint, Computing the constrained Euclidean, geodesic and link centers of a simple polygon with applications,Proceedings of Computer Graphics International (CGI'96), Pohang, Korea, 1996.

207. H. Boomari and A. Zarei, Visibility graphs of anchor polygons, In Proceedings of International Conference on Topics in Theoretical Computer Science, pp. 72-89, Springer International Pub- lishing, 2015.

208. S. Brahma, S. P. Pal and D. Sarkar, A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections, Journal of Geometry, vol. 81, pp. 5-14, 2004.

209. A. Briggs and B. R. Donald, Visibility-Based Planning of Sensor Control Strategies, Algorithmica, vol. 26(3/4), pp. 364-388, 2000.

210. C. A. Brocker and A. Lopez-Ortiz, Position-Independent Street Searching, Proceedings of the 6th International Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Springer Verlag, no. 1633, pp. 241-251, 1999.

211. O. Burdakov, P. Doherty, K. Holmberg and P. Olsson, Optimal placement of communications relay nodes, Journal of Global Optimization, Online publication, 2010.

212. K. Buchin, I. Kostitsyna, M. Loffer and R. I. Silveiraz, Region-based approximation algorithms for visibility between imprecise locations, Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 94-103, 2015.

213. S. E. Butta and T. M. Cavalierb, An efficient algorithm for facility location in the presence of forbidden regions, European Journal of Operational Research, vol. 90, pp. 56-70, 1996.

214. M. N. Bygi and M. Ghodsi, Visibility of a moving segment, Proceeedings of the International Conference on Computational Science and Its Applications, pp. 169-176, 2009.

215. M. N. Bygi and M. Ghodsi, Weak visibility queries in simple polygons, Proceedings of the Canadian Conference on Computational Geometry, pp. 1-6, 2011.

216. M.N. Bygi and M. Ghodsi, Weak visibility queries of line segments in simple polygons and polygonal domains, International Journal of Computer Mathematics, published online, pp. 1-18, 2017.

217. S. Cabello and M. Saumell, A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon, Discrete Mathematics and Theoretical Computer Science, vol. 17, no. 1, p. 1, 2015

218. L. Cai, Algorithms on polygonal embedding of graphs, Proceedings of the Canadian Conference on Computational Geometry, pp. 300-305, 1996.

219. H. Cao and O. Wolfson, Nonmaterialized motion information in transport networks, Proceedings of the 10th International Conference on Database Theory, vol. 3363, pp. 173-188, 2005.

220. P. Carmi, E. Friedman and M. Katz, Spiderman graph: visibility in urban regions, Computational Geometry: Theory and Applications, vol. 48, no. 3, pp. 251-259, 2015.

221. J. Chalopin, S. Das, Y. Disser, M. Mihala'k and P. Widmayer, How simple robots benefit from looking back, Proceedings of the 7th International Conference on Algorithms and Co0mlexity, Lecture Notes in Computer Science, Springer, no. 6078, pp. 229-239, 2010.

222. J. Chalopin, S. Das, Y. Disser, M. Mihalak and P. Widmayer, Telling convex from reflex allows to map a polygon, Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, pp. 153-164, 2011.

223. J. Chalopin, S. Das, Y. Disser, M. Mihalak and P. Widmayer, Mapping simple polygons: How simple robots benefit from looking back, Algorithmica, vol. 65, pp. 43-59, 2013.

224. J. Chalopin, S. Das, Y. Disser, M. Mihalak and P. Widmayer, Simple agents learn to find their way: An introduction on mapping polygons, Discrete Applied Mathematics, published online, 2013.

225. K. Charalampous, I. Kostavelis and A Gasteratos, Thorough robot navigation based on SVM local planning , Robotics and Autonomous Systems,2015

226. B. Chan, D. R. Gaur and R. Krishnamurti, A primal-dual algorithm for the unconstrained fractional matching problem, Proceedings of India-Taiwan Conference on Discrete Mathematics, Taiwan, pp. 65-69, 2009.

227. C. Chen, A necessary condition for a graph to be the visibility graph of a simple polygon, Theoretical Computer Science, vol. 276, pp. 417-424, 2002.

228. C. Chen and K. Wu, Disproving a conjecture on planar visibility graphs, Theoretical Computer Science, vol. 255, pp. 659-665, 2001.

229. D. Chen, An optimal parallel algorithm for detecting weak visibility of a simple polygon, International Journal of Computational Geometry and Applications, vol. 5, no. 1-2, pp. 93-124, 1995.

230. D. Chen, Optimally computing the shortest weakly visible subedge for a simple polygon, Journal of Algorithms, vol. 20, pp. 459-478, 1996.

231. D. Chen, Determining weak visibility of a polygon from an edge in parallel, International Journal of Computational Geometry and Applications, vol. 8, no. 3, pp. 277-304, 1998.

232. D. Chen, J. Hershberger, and H. Wang, Computing shortest paths amid convex pseudodisks, SIAM Journal on Computing, vol. 42, pp. 1158-1184, 2013.

233. D. Chen, X. S. Hu and X. Wu, Optimal polygon cover problems and applications, International Journal of Computational Geometry and Applications, vol. 12, pp. 309-338, 2002.

234. D. Chen and H. Wang, Computing shortest paths amid pseudodisks, Prooceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms, pp. 309-326, 2011.

235. D. Chen and H. Wang, A nearly optimal algorithm for finding L1 shortest paths among polygonal obstacles in the plane, Proceedings of the 19th European Symposium on Algorithms, Lecture Notes in Computer Science, Springer, no. 6942, pp. 481-491, 2011.

236. D. Chen and H. Wang, Computing the visibility polygon of an island in a polygonal domain, Proceedings of the 39th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Springer, no. 7391, pp. 218-229, 2012.

237. D. Chen and H. Wang, Weak visibility queries of line segments in simple polygons, Algorithms and Computations, vol. 7676, pp. 609-618, 2012.

238. D. Chen and H. Wang, Computing shortest paths among curved obstacles in the plane, ACM Transactions on Algorithms, vol. 11, no. 4, pp. 26, 2015.

239. D. Chen, and H. Wang, A new algorithm for computing visibility graphs of polygonal obstacles in the plane, Journal of Computational Geometry, vol. 6, no. 1, pp. 316-345, 2015.

240. Y. Chen and D. Ierardi, Time-optimal trajectories of a rod in the plane subject to velocity constraints, Algorithmica, vol. 18, pp. 165-197, 1997.

241. Z. Chen, M. Lin, S. Li, and R. Liu, Evaluation on path planning with a view towards application, In Proceedings of 3rd International Conference on Control, Automation and Robotics (ICCAR), IEEE, pp. 27-30, 2017.

242. Z. Chen, Y. Xu and L. Wu, Vector planar elements: Geometrical similarity measurement based on Fourier descriptors, GEOMATICA, vol. 69, no. 4, pp. 385-394, 2015.

243. O. Cheong, A. Efrat and S. Har-Peled, On finding a guard that sees most and a shop that sells most, Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 1098-1107, 2004.

244. Q. Cheng, M. Chrobak and G. Sundaram, Computing simple paths among obstacles, Computational Geometry: Theory and Applications, vol. 16, pp. 223-233, 2000.

245. Y. Chiang and R. Tammassia, Optimal shortest path and minimum link path queries in the presence of obstacles, Proceeding of the Conference on Algorithms, Lecture Notes in Computer Science, Springer Verlag, no. 855, pp. 266-277, 1994.

246. Y. Chiang and R. Tammassia, Optimal shortest path and minimum link path queries between two convex polygons inside a simple polygonal obstacles, International Journal of Computational Geometry and Applications, vol. 7, pp. 85-121, 1997.

247. S. Choi, S. Shin and K. Chwa, Visibility properties embedded in k-trees and extremal visibility graphs, Proceedings of Infoscience, Korea Information Science Society, pp. 723-730, 1993.

248. S.Y. Chou and C.C. Chou, A linear time algorithm for minimum conic link path in a simple polygon Expert Systems with Applications, vol. 45, pp. 286-293, 2016.

249. S. Choi, S. Shin and K. Chwa, Characterizing and recognizing the visibility graph of a funnel shaped polygon, Algorithmica, vol. 14, pp. 27-51, 1995.

250. J. Choi and C. Yap, Rectilinear Geodesics in 3-space, Proceedings of the ACM Symposium on Computational Geometry, pp. 380-389, 1995.

251. T. Christ, Beyond triangulation: Covering polygons with triangles, Proceeding of the 12th International Symposium on Algorithms and Data Structures, Lecture Notes in Computer Science, Springer, vol. 855, pp. 231-242, 2011.

252. M. Chrobak, L. Gsieniec, T. Gorry, and R. Martin, Group search on the line, SOFSEM 2015: Theory and Practice of Computer Science, Springer, pp. 164-176, 2015.

253. N. Coll, N. Madern and J. A. Sellares, Good-visibility maps visualization, The Visual Computer, vol. 26, no. 2, pp. 109-120, 2010.

254. P. Colley, A. Lubiw and J. Spinrad, Visibility graphs of towers, Computational Geometry: Theory and Applications, vol. 7, pp. 161-172, 1997.

255. A. F. Cook and C. Wenk, Link distance and shortest path problems in the plane, Computational Geometry: Theory and Applications, vol. 44, pp. 442-455, 2011.

256. A. Collins, J. Czyzowicz, L. Gasieniec, A. Kosowski, and E. Kranakis, Optimal Patrolling of Fragmented Boundaries, Proceedings of the 25th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 241-250, 2013.

257. C. Coullard and A. Lubiw, Distance visibility graphs, International Journal of Computational Geometry and Applications, vol. 2, no. 4, pp. 349-362, 1992.

258. M. C. Couto, P. J. de Rezende and C. C. de Souza, An exact algorithm for minimizing vertex guards on art galleries, International Transactions in Operational Research, vol.18, pp. 425-448, 2011.

259. M. C. Couto, C. C. de Souza and P. J. de Rezende, An exact and efficient algorithm for the orthogonal art gallery problem, Proceedings of the 20th Brazilian Symposium on Computer Graphics and Image Processing, pp. 87-94, 2007.

260. M. C. Couto, C. C. de Souza and P. J. de Rezende, Experimental evaluation of an exact algorithm for the orthogonal art gallery problem, Proceedings of Experimental Algorithms, Lecture Notes in Computer Science, Springer, no. 5038, pp. 101-113, 2008.

261. R. V. Cowlagi and P. Tsiotras, On the existence and synthesis of curvature-bounded paths inside nonuniform rectangular channels, Proceedings of Ameriacan Control Conference, pp. 5382-5387, 2010.

262. J. Czyzowicz, D. Ilcinkas, A. Labourel and A. Pelc, Optimal exploration of terrains with obstacles, Proceedings of the 13th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Springer, no. 6139, pp. 1-12, 2010.

263. J. Czyzowicza, D. Ilcinkasb, A. Labourelc and A. Pelca, Worst-case optimal exploration of terrains with obstacles, Information and Computation, vol. 225, pp. 16–28, 2013.

264. J. Czyzowicz, A. Labourel and A. Pelc, Optimality and competitiveness of exploring polygons by mobile robots, Proceedings of the 17th Annual European Symposiumon Algorithms, Lecture Notes in Computer Science, Springer, no. 5757, pp. 263-274, 2009.

265. O. Daescu and J. Luo, Computing simple paths on points in simple polygons, Proceedings of the International Conference on Computational Geometry and Graph Theory, Lecture Notes in Computer Science, Springer, no. 4535, pp. 41-55, 2008.

266. J. Danciger, S. L. Devadoss and D. Sheehy, Compatible triangulations and point partitions by series-triangular graphs, Computational Geometry: Theory and Applications, vol. 34, pp. 195-202, 2006.

267. G. Das, The visibility graph contains a bounded-degree spanner, Proceedings of the Canadian Conference on Computational Geometry, pp. 70-75, 1997.

268. G. Das and D. Joseph, Minimum vertex hulls for polyhedral domains, Theoretical Computer Science, vol. 103, pp. 107-135, 1992.

269. G. Das and G. Narasimhan, Geometric searching and link distances, Proceedings of the Conference on Algorithms and Data Structures, Lecture Notes in Computer Science, Springer-Verlag, no. 519, pp. 261-271, 1991.

270. K. Das and M. Pal, An optimal algorithm to find maximum and minimum height spanning trees on cactus graphs, Advanced Modeling and Optimization, vol. 10, no. 1, pp. 121-134, 2008.

271. A. Datta and C. Icking, Competitive searching in a generalized street, Computational Geometry: Theory and Applications, vol. 13, pp. 109-120, 1999.

272. G. Dehghani and H. Morady, An algorithm for visibility graph recognition on planar grpahs, Proceedings of International Conference on Future Computer and Communication, pp. 518-521, 2009.

273. A. Deshpande, T. Kim, E. D. Demaine1 and S. E. Sarma, A pseudopolynomial time O(log n)-approximation algorithm for art gallery problems, Proceedings of the 10th International Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Springer-Verlag, no. 4619, pp. 163-174, 2007.

274. Y. Disser, M. Mihala'k and P. Widmayer, Reconstructing a simple polygon from its angles, Proceedings of the 13th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Springer, no. 6139, pp. 13-24, 2010.

275. Y. Disser, M. Mihalak and P. Widmayer, A polygon is determined by its angles, Computational Geometry: Theory and Applications, vol. 44, pp. 418-426, 2011.

276. Y. Disser, M. Mihalak and P. Widmayer, Mapping polygons with agents that measure angles, Proceedings of the 10th Workshop on the Algorithmic Foundations of Robotics, Springer Tracts in Advanced Robotics, vol. 86, pp 415-425, 2013.

277. I. Dolinskaya and R. Smith, Fastest-path planning for direction-dependent speed functions, Journal of Optimization Theory and Applications, vol. 158, pp. 480-497, 2013.

278. D. P. Dobkin, E. R. Gansner, E. Koutsofios and S. C. North, Implementing a general-purpose edge router, Proceedings of the 5th International Symposium on Graph Drawing, pp. 262-271, 1997.

279. S. Durocher, O. Filtser, R. Fraser, A. Mehrabi and S. Mehrabi, A (7/2)-approximation algorithm for guarding orthogonal art galleries with sliding cameras, Proceedings of the 11th Latin American Symposium on Theoretical Informatics, pp. 294-305, 2014.

280. A. Dumitrescu and J. Mitchell, Approximation algorithms for TSP with neighborhoods in the plane, Journal of Algorithms, vol. 48, pp. 135-159, 2003.

281. A. Dumitrescu and C. D. Toth, Long non-crossing configurations in the plane, Discrete and Computational Geometry, vol. 44, pp. 727-752, 2010.

282. A. Dumitrescu and C. D. Toth, Watchman tours for polygons with holes<\I>, Computational Geometry: Theory and Applications, vol. 45, pp. 326-333, 2012.

283. F. Durand and C. Puech, The visibility complex made visibly simple: an introduction to 2D structures of visibility, Proceedings of the ACM Symposium on Computational Geometry, pp. V2, 1995.

284. M Dutt, A. Biswas, P. Bhowmick and B. B. Bhattacharya, On finding shortest isothetic path inside a digital object, Proceedings of the 15th International Workshop on Combinatorial Image Analaysis, Lecture Notes in Computer Science, Springer, no. 7655, pp. 1-15, 2012.

285. M Dutt, A. Biswas, P. Bhowmick and B. B. Bhattacharya, On finding shortest isothetic path inside a digital object, Computer Vision and Image Understanding, vol. 129, pp. 75-88, 2014.

286. T. Dwyer and L. Nachmanson, Fast edge-routing for large graphs, Proceedings of the 17th International Symposium on Graph Grawing, Lecture Notes in Computer Science, Springer-Verlag, no. 5849, pp. 147-158, 2010.

287. A. Efrat and S. Har-Peled, Locating guards in art galleries, Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, pp. 181-192, 2002.

288. A. Efrat and S. Har-Peled, Guarding galleries and terrains, Information Processing Letters, vol. 100, pp. 238-245, 2006.

289. A. Efrat, S. Har-Peled and J.S.B. Mitchell, Approximation algorithms for two optimal location problems in sensor networks, Proceedings of the 2nd International Conference on Broadband Networks, vol. 1, pp. 714- 723, 2005.

290. A. Efrat, G. Rote and M. Sharir, On the union of fat wedges and separating a collection of segments by a line, Computational Geometry: Theory and Applications, vol. 3, pp. 277-288, 1993.

291. S. Eidenbenz, Inapproximability results for guarding polygons without holes, Proceedings of International Symposium on Algorithms and Computations, LNCS, Springer-Verlag, vol. 1533, pp. 427 - 436, 1998.

292. S. Eidenbenz, Approximation algorithms for terrain guarding, Information Processing Letters, vol. 82, pp. 99-105, 2002.

293. S. Eidenbenz, Optimum inapproximability results for finding minimum hidden guard sets in polygons and terrains, Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, no. 2368, pp. 60-68, 2002.

294. S. Eidenbenz, Finding minimum hidden guard sets in polygons—tight approximability results, Computational Geometry: Theory and Applications, vol. 34, no. 2, pp. 49-57, 2006.

295. S. Eidenbenz and C. Stamm, Maximum clique and minimum clique partition in visibility graphs, IFIP TCS, Lecture Notes in Computer Science, Springer-Verlag, 2000.

296. S. Eidenbenz and C. Stamm and P. Widmayer, Inapproximability of some art gallery problems, Proceedings of the 10th Canadian Conference on Computational Geometry, pp. 64-65, 1998.

297. S. Eidenbenz and C. Stamm and P. Widmayer, Inapproximability results for guarding polygons and terrains, Algorithmica, vol. 31, pp. 79-113, 2001.

298. S. Eidenbenz and P. Widmayer, An approximation algorithm for minimum convex cover with logarithmic performance guarantee, SIAM Journal on Computing, vol. 32, pp. 654-670, 2003.

299. I. Emiris, C. Fragoudakis and E. Markou, Maximizing the guarded interior of an art gallery, Proceedings of the 22nd European Workshop on Computational Geometry, pp. 165-172, 2006.

300. L. H. Erickson and S. M. LaValle, How many landmark colors are needed to avoid confusion in a polygon? Proceedings of IEEE International Conference on Robotics and Automation, to appear, 2011.

301. L. H. Erickson and S. M. LaValle, An art gallery approach to ensuring that landmarks are distin- guishable, Proceedings of Robotics: Science and Systems, pp. 81-88, 2011.

302. H. Everett and D. Corneil, Recognizing visibility graphs of spiral polygons, 1990, Journal of Algorithms, vol. 11, pp. 1-26.

303. H. Everett and D. Corneil, Negative results on characterizing visibility graphs, Computational Geometry: Theory and Applications, vol. 5, pp. 51-63, 1995.

304. H. Everett, C. T. Hoang, K. Kilakos and M. Noy, Planar segment visibility graph, Computational Geometry: Theory and Applications, vol. 16, pp. 235-243, 2000.

305. H. Everett, F. Hurtado and M. Noy, Stabbing information of a simple polygon, Proceedings of the Canadian Conference on Computational Geometry, pp. 74-79, 1996.

306. S. P. Fekete, Joseph S. B. Mitchell and Christiane Schmidt, Minimum covering with travel cost, Journal of Combinatorial Optimization, online 2010.

307. S. P. Fekete and C. Schmidt, Polygon exploration with time-discrete vision, Computational Geometry:Theory and Applications, vol. 43, no. 2, pp. 148-168, 2010.

308. S. P. Fekete, S. Friedrichs, A. Kroller and C. Schmidt, Facets for Art Gallery Problems, Proceedings of th 19th International Conference on Computing and Combinatorics, Lecture Notes in Computer Science, Springer, no. 7936, pp. 140-148, 2013.

309. E. Fox-Epstein, C. D. T ́th and A. Winslow, Diffuse reflection radius in a simple polygon, Proceedings of Computing and Combinatorics, pp. 239-250, 2014.

310. C. Fragoudakis, E. Markou and S. Zachos, How to place efficiently guards and paintings in an art gallery, Panhellenic Conference on Informatics, pp. 145-154, 2005.

311. C. Fragoudakis, E. Markou and S. Zachos, Maximizing the guarded boundary of an art gallery is APX-complete, Computational Geometry: Theory and Applications, vol. 38, pp. 170-180, 2007.

312. K. Fujimura1 and H. Samet, Planning a time-minimal motion among moving obstacles, Algorithmica, vol. 10, pp. 41-63, 1993.

313. K. Fujimura1 and H. Samet, Motion planning in a dynamic domain, Procceding of IEEE International Confonference on Robotics and Automation, pp. 324-330, 1990.

314. G. Fusco and H. Gupta, Placement and orientation of rotating directional sensors, Procceding of the 7th Annual IEEE Communications Society Conference on Sensor Mesh and Ad Hoc Communications and Networks (SECON), pp. 1-9, 2010.

315. A. Garcia, F. Hurtado, C. Huemer and J. Tejel, On triconnected and cubic plane graphs on given point sets, Computational Geometry, vol. 42, pp. 913-922, 2009.

316. E. Garcia and P. G. de Santos, Mobile-robot navigation with complete coverage of unstructured environments, Robotics and Autonomous Systems, vol. 46, pp. 195-204, 2004.

317. E. Garcia and P. G. de Santos, Mobile-robot navigation with complete coverage of unstructured environments, Robotics and Autonomous Systems, vol. 46, pp. 195-204, 2004.

318. Y. Gao and B. Zheng, Continuous obstructed nearest neighbor queries in spatial databases, Proceedings of the 35th SIGMOD International Conference on Management of Data, pp. 577-590, 2009.

319. Y. Gao, B. Zheng, G. Chen, C. Chen, and Q. Li, Continuous nearest-neighbor search in the presence of obstacles, ACM Transaction on Database Systems, vol. 36, no. 2, article 9, pp. 1-43, 2011

320. A. Gasteratos, Optimum multi-camera arrangement using a bee colony algorithm, Proceedings of IEEE International Conference on Imaging Systems and Techniques, pp. 387-392, 2012.

321. K. Gdawiec, Star-shaped set inversion fractals , Fractals, vol. 22, pp. 1-7, 2014.

322. L. Gewali, A. Meng, J. Mitchell and S. Ntafos, Path Planning in 0/1 weighted regions with applications, Proceedings of the ACM Symposium on Computational Geometry, pp. 266-278, 1988.

323. L. Gewali, S. Ntafos and I. G. Tollis, Path Planning in the presence of vertical obstacles, IEEE Transactions on Robotics and Automation, vol. 6, pp. 331-341, 1990.

324. S. Ghali, Computation and Maintenance of Visibility and Shadows in the Plane, Proceedings of the sixth Int. Conf. in Central Europe on Computer Graphics and Visualization, pp. 117-124, 1998.

325. S. Ghali and A. Stewart, Maintenance of the set of segments visible from a moving viewpoint in two dimension, Proceedings of the ACM Symposium on Computational Geometry, pp. V3-4, 1996.

326. M. Ghodsi, A. Maheshwari, M. Nouri, J.-R. Sack and H. Zarrabi-Zadeh, α -Visibility, Proceedings of the 13th Scandinavian Symposium and Workshop on Algorithm Theory, Lecture Notes in Computer Science, Springer, no. 7357, pp. 1-12, 2012.

327. M. Gibson, G. Kanade, E. Krohn, and K. Varadarajan, An approximation scheme for terrain guarding, Proceedings of the 12th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Lecture Notes in Computer Science, Springer, no. 5687, pp. 140-148, 2009.

328. A. Gilbers and R. Klein, A new upper bound for the VC-dimension of visibility regions, Proceedings of the ACM Symposium on Computational Geometry, pp. 380-386, 2011.

329. M. Gibson, G. Kanade, E. Krohn, and K. Varadarajan, An approximation scheme for terrain guarding , Proceedings of the 12th International Workshop on Approximation Algorithms for Com- binatorial Optimization Problems, Lecture Notes in Computer Science, Springer, no. 5687, pp. 140-148, 2009.

330. M. T. Goodrich, Intersecting line segments in parallel with an output-sensitive number of processors, Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 127-137, 1989.

331. M. T. Goodrich, Efficient Piecewise-linear function approximation using the uniform metric, Discrete and Computational Geometry, vol. 14, pp. 445-462, 1995.

332. D. Grigoriev and A. Slissenko, Computing minimum-link path in a homotopy class amidst semi-algebraic obstacles in the plane, Proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lecture Notes in Computer Science, Springer-Verlag, no. 1255, pp. 114-129, 1997.

333. J. Gudmundsson and P. Morin, Planar visibility: Testing and counting, Proceedings of the ACM Symposium on Computational Geometry, pp. 77-86, 2010.

334. L. Guibas, J. Hershberger, J. Mitchell and J. Snoeyink, Approximating polygons and subdivisions with minimum-link paths, International Journal of Computational Geometry and Applications, vol. 3, no. 4, pp. 383-415, 1993.

335. K. Gupta and Y. Yu, On eye-sensor based path planning for robots with non-trivial geometry/kinematics, Proceedings of the 2001 IEEE International Conference on Robotics and Automation, Korea, pp. 265-270, 2001.

336. L. Habert and M. Pocchiola, Computing pseudotriangulations via branched coverings, Discrete and Computational Geometry, vol. 48, pp. 518-579, 2012.

337. M. Hagedoorn, M. H. Overmars and R. C. Veltkamp, A New Visibility Partition for Affine Pattern Matching, Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery, Lecture Notes in Computer Science, Springer-Verlag, no. 1953, pp. 358-370, 2000.

338. P. Hefferman and J. Mitchell, Structured visibility profiles with applications to problems in simple polygons, Proceedings of the ACM Symposium on Computational Geometry, pp. 53-62, 1990.

339. R.V. Helgason, J.L. Kennington and K.R. Lewis, A heuristic algorithm for automatic path generation, Journal of Heuristic, vol. 7, pp. 473-494, 2001.

340. J. Hershberger, An optimal visibility graph algorithm for triangulated simple polygon, Algorithmica, vol. 4, pp. 141-155, 1989.

341. J. Hershberger, Optimal parallel algorithms for triangulated simple polygons, International Journal of Computational Geometry and Applications, vol. 5, no. 1, pp. 145-170, 1995.

342. J. Hershberger and J. Snoeyink, Computing minimum lengths paths of a given homotopy class, Computational Geometry: Theory and applications, vol. 4, pp. 63-97, 1994.

343. J. Hershberger and S. Suri, Efficient computation of Euclidean shortest paths in the plane, Proceeding of the IEEE Symposium on the Foundation of Computer Science, pp. 508-517, 1993.

344. J. Hershberger and S. Suri, An optimal-time algorithm for Euclidean shortest paths in the plane, SIAM Journal on Computing, vol. 26, pp. 2215-2256, 1999.

345. J. Hershberger, S. Suri and H. Yldz, A near-optimal algorithm for shortest paths among curved obstacles in the plane, Proceedings of the ACM Symposium on Computational Geometry, pp. 359-368, 2013.

346. Y. Higashikawa and N. Katoh, Online exploration of all vertices in a simple polygon, Joint International Conference on Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, Lecture Notes in Computer Science, Springer, vol. 7285, pp. 315-326, 2012.

347. Y. Higashikawa and N. Katoh, Online vertex exploration problems in a simple polygon, IEICE Transactions on Information and Systems, Vol. E96-D, pp. 489-497, 2013.

348. F. Hoffmann, C. Icking, R. Klein, K. Kriegel, A competitive strategy for learning a polygon, Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, pp. 166-174, 1997.

349. M. Hoffmann and C. Toth, Segment endpoint visibility graphs are Hamiltonian, Computational Geometry: Theory and Applications, vol. 26, pp. 47-68, 2003.

350. R. Hohzaki, Yokosuka, S. Morita and Y. Terashima, A patrol problem in a building by search theory, Proceedings of IEEE Symposium on Computational Intelligence for Security and Defense Applications, pp. 104-111, 2013.

351. I. Hong and A. Murray, Efficient measurement of continuous space shortest distance around barriers, International Journal of Geographical Information Science, vol. 27, pp. 2302-2318, 2013

352. I. Hong and A. Murray, Efficient wayfinding in complex environments: derivation of a continuous space shortest path, Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science, pp. 61, 2013.

353. C. Icking, T. Kamphans, R. Klein and E. Langetep, On the competitive complexity of navigation tasks, Proceedings of International Workshop on Sensor Based Intelligent Robots, Lecture Notes in Computer Science, Springer-Verlag, no. 2238, pp. 245-258, 2002.

354. C. Icking and R. Klein, Searching for the kernel of a polygon- a competitive strategy, Proceedings of the ACM Symposium on Computational Geometry, pp. 258-266, 1995.

355. C. Icking, R. Klein, E. Langetepe, S. Schuierer and I. Semrau, An optimal competitive strategy for walking in streets, SIAM Journal on Computing, vol. 33, pp. 462-486, 2004.

356. R. Inkulu and S. Kapoor, Finding a rectilinear shortest path in R2 using corridor based staircase structures, Proceedings of the 27th International Conference on the Foundation of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Springer-Verlag, no. 4855, pp. 412-423, 2007.

357. R. Inkulu and S. Kapoor, Planar rectilinear shortest path computation using corridors, Computational Geometry: Theory and Applications, vol. 42, no. 9, pp. 873-884, 2009.

358. M. Ishaque, D. L. Souvaine and C. D. Toth, Disjoint compatible geometric matchings, Proceedings of the ACM Symposium on Computational Geometry, pp. 125-134, 2011.

359. M. Ishaque, B. Speckmann and C. D. Toth, Shooting permanent rays among disjoint polygons in the plane, SIAM Journal on Computing, vol. 41, pp. 1005-1027, 2012.

360. M. Ishaque and C. D. Toth, Relative convex hulls in semi-dynamic subdivisions, Proceedings of the 16th Annual European Symposium on Algorithms, Lecture Notes in Computer Science, Springer, no. 5193, pp. 780-792, 2008.

361. M. Ishaque and C. D. Toth, Relative convex hulls in semi-dynamic arrangements, Algorithmica, published online, 2012.

362. V. Isler, S. Kannan, K. Daniilidis and P. Valtr, VC-Dimension of exterior visibility, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, pp. 667-671, 2004.

363. J. A. Janet, R. C. Luo and M. G. Kay, Autonomous mobile robot global motion planning and geometric beaconcollection using traversability vectors, IEEE Transactions on Robotics and Automation, vol. 13, pp. 132-140, 1997.

364. B. Jiang and X. Tan, Searching for mobile intruders in circular corridors by two 1-searchers, Discrete Applied Mathematics, 2011 (to appear).

365. S. Kahan and J. Snoeyink, On the bit complexity of minimum link paths: superquadratic algorithms for problems solvable in linear time, Proceedings of the ACM Symposium on Computational Geometry, pp. 151-158, 1996.

366. A. Kahng and C. Tsao, More practical bounded-skew clock routing, Proceedings of the 34th annual conference on Design automation, pp. 594-599, 1997.

367. H. Kaluder, M. Brezal and I. Petrovic, A visibility graph based method for path planning in dynamic environments, MIPRO Proceedings of the 34th International Convention, pp. 717-721, 2011.

368. T. Kamada and J. Z. Zhang, Finding all door locations that make a room searchable, International Journal of Computational Geometry and Applications, vol. 20, pp. 175-201, 2011.

369. G. Kant, G. Liotta, R. Tamassia and I. G. Tollis, Area requirement of visibility representations of trees, Information Processing Letters, vol. 62, pp. 81-88, 1997.

370. S. Kapoor and S. N. Maheshwari, Efficient algorithms for Euclidian shortest path and visibility problems with polygonal obstacles, Proceedings of the ACM Symposium on Computational Geometry, pp. 172-182, 1988.

371. S. Kapoor and S. N. Maheshwari, Efficiently constructing the visibility graph with a simple polygon with obstacles, SIAM Journal on Computing, vol. 30, pp. 847-871, 2000.

372. S. Kapoor, S. N. Maheshwari and J. S. B. Mitchell, An efficient algorithm for Euclidian shortest paths among polygonal obstacles in the plane, Discrete and Computational Geometry, vol. 18, pp. 377-383, 1997.

373. M.J. Katz and G.S. Roisman, On guarding rectilinear domains, Computational Geometry: Theory and Applications, vol. 39, no. 3, pp. 219-228, 2008.

374. M. Keil, D. Mount and S. Wismath, Visibility stabs and depth-first spiralling on line segments in output sensitive time, International Journal of Computational Geometry and Applications, vol. 10, pp. 535-552, 2000.

375. A. Khan, S. P. Pal, M. Aanjaneya, A. Bishnu and S. C. Nandy, Diffuse reflection diameter and radius for convex-quadrilateralizable polygons, Discrete Applied Mathematics, published online, 2013.

376. D. S. Kim, K. Yu, Y. Cho, D. Kim and C. Yap, Shortest paths for disc obstacles, Proceedings of the International Conference of Computational Science and Its Applications, Lecture Notes in Computer Science, Springer-Verlag, no. 3045, pp. 62-70, 2004.

377. J. King, Fast vertex guarding for polygons with and without holes, Computational Geometry: Theory and Applications, vol. 46, pp. 219-231, 2013.

378. J. King and D. Kirkpatrick, Improved approximation for guarding simple galleries from the perimeter, Discrete and Computational Geometry, vol. 46, pp. 252-269, 2011.

379. J. King and E. Krohn, Terrain guarding is NP-hard, SIAM Journal on Computing, vol. 40, pp. 1316-1339, 2011.

380. D. Kirkpatrick and S. Wismath, Determining bar-representability for ordered weighted graphs, Computational Geometry: Theory and Applications, vol. 6, pp. 99-122, 1996.

381. C. Knauer, G. Rote, and L. Schlipf, Shortest inspection-path queries in simple polygons, Proceedings of the 24th European Workshop on Computational Geometry, Nancy, pp. 153-156, 2008.

382. T. Krick, A. O. Slisenko, P. Solerno and J. Heintz, Search for shortest path around semialgebraic obstacles in the plane, Journal of Mathematical Sciences, vol. 70, pp. 1944-1949, 1994.

383. E. A. Krohn and B. J. Nilsson, Approximate guarding of monotone and rectilinear polygons, Algorithmica, vol. 66, pp. 564-594, 2013.

384. T. Krick, A. O. Slisenko, P. Solerno and J. Heintz, Search for shortest path around semialgebraic obstacles in the plane, Journal of Mathematical Sciences, vol. 70, pp. 1944-1949, 1994.

385. S. S. Krishnan and A. C. Sanderson, The window corner algorithm for robot path planning with translations, Proceedings of the IEEE International Conference on Robotics and Automation, vol. 3, pp. 2303-2308, 1992.

386. Y.-F. Lan, Y.-L. Wang and H. Suzukib, A linear-time algorithm for solving the center problem on weighted cactus graphs, Information Processing Letters, vol. 71, pp. 205-212, 1999.

387. E. Langetepe, R. Penninger and J. Tulke, Computing the visibility area between two simple polygons in linear time, Proceedings of the 26th European Workshop on Computational Geometry, Dortmund, pp. 237-240, 2010.

388. A. Laurentini, The surveillance of the walls of an art gallery, Proceedings of the Canadian Conference on Computational Geometry, pp.223-233, 1996.

389. A. Li, F. Amigoni and N. Basilico, Searching for optimal off-line exploration paths in grid envi- ronments for a robot with limited visibility, Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, pp. 2060-2066, 2012.

390. F. Li and R. Klette, An approximate algorithm for solving the watchman route problem, Proceedings of the 2nd International Workshop on Robot Vision, Lecture Notes in Computer Science, Springer, no. 4931, pp. 189-206, 2008.

391. J. Lien, Approximate star-shaped decomposition of point set data, Proceedings of the IEEE/Eurographics Symposium on Point-Based Graphics, pp. 1-8, 2007.

392. S. Y. Lin and C. Y. Chen, Planar visibility graphs, Proceedings of the Canadian Computational Geometry, pp. 30-35, 1994.

393. A. Lingas, A. Maheshwari and J-R. Sack, Optimal parallel algorithms for rectilinear link-distance problems, Algorithmica, vol. 14, pp. 261-289, 1995.

394. S. Y. Lin and S. Skiena, Complexity aspects of visibility graphs, International Journal of Computational Geometry and Applications, vol. 5, no. 1-2, pp. 289-312, 1995.

395. R. Lopez-Padilla, R. Murrieta-Cid and S. M. LaValle, Optimal gap navigation for a disc robot, Proceedings of the 10th Workshop on the Algorithmic Foundations of Robotics, Springer Tracts in Advanced Robotics, vol. 86, pp 123-138, 2013.

396. L. Lu, C. Yang and J. Wang, Point visibility computing in polygons with holes, Journal of Information and Computational Science, vol. 8:16, pp. 4165-4173, 2011.

397. L. Lu, C. Yang, J. Wang and J. Zhang, Voronoi-based potentially Visible set and visibility query algorithms, Proceedigs of the 8th International Symposium on Voronoi Diagrams in Science and Engineering, pp. 234-240, 2011.

398. A. Lubiw, J. Snoeyink and H. Vosoughpour, Visibility graphs, dismantlability, and the cops and robbers game, Proceedings of Canandian Conference on Computational Geometry, pp. 1-14, 2014.

399. L. Lulu and A. Elnagar, A comparative study between visibility-based roadmap path planning algorithms, IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 3263- 3268, 2005.

400. D. Madden, D. Delaney, S. McLoone and T. Ward, Visibility path-finding in relation to hybrid strategy-based models in distributed interactive applications, Proceedings of the 8th IEEE International Symposium on Distributed Simulation and Real-Time Applications, pp. 91-97, 2004.

401. A. Maheshwari and J.-R. Sack, Simple optimal algorithms for rectilinear link path and polygon separation problems, Parallel Processing Letters, vol. 9, pp. 31-42, 1999.

402. P. Marbate and P. Jaini, Role of Voronoi disagram approach in path planning, International Journal of Engineering Science and Technology, vol. 5, pp. 527-532, 2013.

403. E. Markou, S. Zachos and C. Fragoudakis, Budgeted coverage of a maximum part of a polygonal area, Proceedings of the 1st Balkan Conference on Informatics, pp. 174-182, 2003.

404. E. Markou, S. Zachos and C. Fragoudakis, Budgeted coverage of a maximum part of a polygonal area, Proceedings of the 1st Balkan Conference on Informatics, pp. 174-182, 2003.

405. R. McGarvey and T. Cavalier, A global optimal approach to facility location in the presence of forbidden regions, Computers and Industrial Engineering, vol. 45, pp. 1-15, 2003.

406. N. Megowa, K. Mehlhorna, and P. Schweitzer, Online graph exploration: New results on old and new algorithms, Theoretical Computer Science, vol. 463, pp. 62–72, 2012.

407. A. C. Meng, S. Ntafos, M. Tsoukalas, An approach to real-time flexible path planning, Robotic Systems: Advanced Techniques and Applications (Editor: S. Tsoukalas), pp. 253-260, Kluwer Academic Publishers, 1992.

408. J. Mitchell, A new algorithm for shortest paths among obstacles in the plane, Annals of Mathematics and Artificial Intelligence vol. 3, no. 1, pp. 83-105, 1991.

409. J. Mitchell, Shortest path among obstacles in the plane, International Journal of Computational Geometry and Applications, vol. 6, no. 3, pp. 309-332, 1996.

410. J. Mitchell and C. H. Papadimitriou, The weighted region problem: Finding shortest paths through a weighted planar subdivision, Journal of ACM, vol. 38, no. 1, pp. 18-73, 1991,.

411. J.S.B. Mitchell, C. Piatko and E. M. Arkin, Computing a shortest k-link path in a polygon , Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pp. 573-582, 1992.

412. J. Mitchell, V. Polishchukb and M. Sysikaskib, Minimum-link paths revisited, Computational Geometry: Theory and Applications, vol. 47, pp. 651–667, 2014.

413. J. Mitchell, G. Rote and G. Woeginger, Minimum-link paths among obstacles in the plane, Algorithmica, vol. 8, pp. 431-459, 1992.

414. J. Mitchell and E. L. Wynters, Finding optimal bipartitions of points and polygons, Proceedings of the Conference on Algorithms and Data Structures, Lecture Notes in Computer Science, Springer-Verlag, no. 519, pp. 202-213, 1991.

415. A. Mittal and L. Davis, A general method for sensor planning in multi-sensor systems: Extension to random occlusion, International Journal of Computer Vision, vol. 76, no. 1, pp. 31-52, 2008.

416. E. Moet, C. Knauer and M. van Kreveld, Visibility maps of segments and triangles in 3D, Computational Geometry: Theory and Applications, vol. 39, no. 3, pp. 163-177, 2008.

417. M. H. Moghaddam, A. Bagheri, A. S. Mamaghani and S. T. Afshord, Guarding Strategic Points of a Gallery, Proceedings of the International Conference on Computer Technology and Development, pp. 121-124, 2009.

418. M.K. Mohanty, S. Sadhu, N. Kumar and K Pati, Generating empty convex polygon randomly from a subset of given point set, J. K. Mondal et al. (eds.), Information System Design and Intelligent Applications, Advances in Intelligent Systems and Computing, vol 339, pp. 311-318, 2015.

419. H. Morady and G. Dehghani, An algorithm for visibility graph recognition on special case, Proceedings of International Conference on Future Computer and Communication, pp. 209-211, 2009.

420. E. Morini, F. Rocchi, C. A. Avizzano and M. Bergamasco, Visibility techniques applied to robotics, Proceedings of the 19th IEEE International Symposium on Robot and Human Interactive Communication, pp. 367-372, 2010.

421. A. Mukhopadhyay, C. Drouillard and G. Toussaint, Gurding simple polygons with semi-open edge guards, Proceedings of the 3rd International Conference on Digital Information Processing and Communications, pp. 417-422, 2013.

422. P. Mukkamala, J. Pach and D. Sarioz, Graphs with large obstacle numbers, Proceedings of Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Springer, no. 6410, pp. 292-303, 2010.

423. K. Nechvíle and P. Tobola, Dynamic visibility in the plane, Proceedings of the 15th Spring Conference on Computer Graphics, pp. 187-194, 1999.

424. T. T. N. Nguyet, T. V. Hoai and N. A. Thi, Some advanced techniques in reducing time for path planning based on visibility graph, Proceedings of the Third International Conference on Knowledge and Systems Engineering, pp. 190-194, Hanoi, 2011.

425. DM Nguyen, M. Pauley and B. J ̈ttler, Isogeometric Segmentation. Part II: On the segmentability of contractible solids with non-convex edge, Graphical Models, vol. 76, pp. 426-439, 2014.

426. B. J. Nilsson, Approximate guarding of monotone and rectilinear polygons, Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Springer-Verlag, no. 3580, pp. 1362-1373, 2005.

427. M. Nouri, A. Zarei1 and M. Ghodsi1, Weak visibility of two objects in planar polygonal scenes, Proceedings of the International Conference on Computational Science and Its Applications (Part I), Lecture Notes in Computer Science, Springer-Verlag, no. 4705, pp. 68-81, 2007.

428. S. Ntafos and L. Gewali, External watchman routes, The Visual Computer, vol. 10, pp. 474-483, 1994.

429. S. Nutanong, E. Tanin and R. Zhang, Visible nearest neighbor queries, Proceedings of the 12th International Conference on Database Systems for Advanced Applications, Lecture Notes in Computer Science, Springer-Verlag, no. 4443, pp. 876-883, 2007.

430. S. Nutanong, E. Tanin and R. Zhang, Incremental evaluation of visible nearest neighbor queries, IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 5, pp. 665-681, 2010.

431. K. Obermeyer, A. Ganguli and F. Bullo, A complete algorithm for searching scheduling, International Journal of Computational Geometry and Applications, vol. 21, pp. 101-130, 2011.

432. J. O'Rourke and I. Streinu, The vertex-edge visibility graph of a polygon, Computational Geometry: Theory and Applications, vol. 10, 105-120, 1998.

433. J. O'Rourke and I. Streinu, Vertex-edge pseudo-visibility graphs: Characterization and Recognition, Proceedings of the ACM Symposium on Computational Geometry, pp. 119-128, 1997.

434. M. Overmars, Connectability Problems, Proceedings of the 1st Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Springer-Verlag, no. 318, pp. 105-112, 1988.

435. M. Overmars and E. Welzl, New methods of computing visibility graphs, Proceedings of the ACM Symposium on Computational Geometry, pp. 164-171, 1988.

436. J. Pach and D. Sarıoz, On the structure of graphs with low obstacle number, Graphs and Combinatorics, vol. 27, pp. 465-473, 2011.

437. E. Packer, Computing Multiple Watchman Routes, Proceedings of the 7th International Workshop on Experimental Algorithms, Lecture Notes in Computer Science, Springer, no. 5038, pp. 114-128, 2008.

438. J. Park, J. S. Choi, J. Kim, S-H. Ji and B. H. Lee, Long-term stealth navigation in a security zone where the movement of the invader is monitored, International Journal of Control, Automation and Systems, vol. 8, pp. 604-614, 2010.

439. S-H. Park, S-H. Ji, D-S. Ryu and H-G.Cho, A new cognition-based chat system for avatar agents in virtual space, Proceedings of The 7th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and its Applications in Industry, Article no. 13, 2008

440. L. Paull, L., C. Thibault, A. Nagaty, M. Seto and H. Li, Sensor-driven area coverage for an autonomous fixed-wing unmanned aerial vehicle, IEEE Transactions on Cybernetics, vol. 44, pp. 1605-1618, 2014.

441. S. Petitjean, A Computational Geometric Approach to Visual Hulls, International Journal of Computational Geometry and Applications, vol. 8, pp. 407-436, 1998.

442. A.C. Pillai, J. Chicka, L. Johanningc, M. Khorasanchid and V. de Laleub, Offshore wind farm electrical cable layout optimization , Engineering Optimization, 2015.

443. M. Pocchiola and G. Vegter, Computing the visibility graph via Pseudo-triangulations, Proceedings of the ACM Symposium on Computational Geometry, pp. 248-257, 1995.

444. M. Pocchiola and G. Vegter, The visibility complex, International Journal of Computational Geometry and Applications, vol. 6, no. 3, pp. 279-308, 1996.

445. M. Pocchiola and G. Vegter, Minimal tangent visibility graphs, Computational Geometry: Theory and Applications, vol. 6, pp. 303-314, 1996.

446. M. Pocchiola and G. Vegter, Topologically sweeping visibility complexes via pseudotriangulations, Discrete and Computational Geometry, vol. 16, pp. 419-453, 1996.

447. D. C. Prasad, S. P. Pal and T. K. Dey, Visibility with multiple diffuse reflections, Computational Geometry: Theory and Applications, vol. 10, no. 3, pp. 187-196, 1998.

448. L. Prasad and S. S. Iyengar, A note on the combinatorial structure of the visibility graph in simple polygons , Theoretical Computer Science, vol. 140, pp. 249-263, 1995.

449. T. K. Priya and K. Sridharan, A parallel algorithm, architecture and FPGA realization for high speed determination of the complete visibility graph for convex objects, Microprocessors and Microsystems, vol. 30, no. 1, pp. 1-14, 2006.

450. A. T. Rashida, A. A. Alib, M. Frascac and L. Fortunac, Path planning with obstacle avoidance based on visibility binary tree algorithm, Robotics and Autonomous Systems, vol. 61, pp. 1440-1449, 2013.

451. J. H. Reif and Z. Sun, On Boundaries of Highly Visible Spaces and Applications, Proceedings of 14th Symposium on Fundamentals of Computation Theory, Lecture Notes in Computer Science, Springer-Verlag, no. 2751, pp. 271-283, 2003.

452. I. Rekleitis, G. Dudek and E. Milios, On multiagent exploration, Proceedings of Visual Interface, pp. 455-461, 1998.

453. A. Remazeilles, F. Chaumette and P. Gros, Robot motion control from a visual memory , Proceedings of the IEEE International Conference on Robotics and Automation, vol.5, pp. 4695- 4700, 2004.

454. S. Riviere, Topologically sweeping the visibility complex of polygonal scenes, Proceedings of the ACM Symposium on Computational Geometry, pp. 436-437, 1995.

455. C. Ronse, A bibliography on digital and computational convexity (1961-1988), Transactions on Pattern Analysis and Machine Intelligence, vol. 11, pp. 181-190, 1989.

456. S. Roy, G. Das and S. Das, Computing best coverage path in the presence of obstacles in a sensor field, Proceedings of the 10th International Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Springer-Verlag, no. 4619, pp. 577-588, 2007.

457. S. Sadhu, A. Bishnu, S. C. Nandy and P. P. Goswami, Cluster connecting problem inside a polygon, In CCCG, pp. 265-268. 2010. Proceedings of the Canadian Conference on Computational Geometry, pp. 265-268. 2010.

458. S. Sadhu, S. Hazarika, K. Jain, S. Basu and T. De, GRP-CH heuristic for generating random simple polygon, Proceedings of the 23rd International Workshop on Combinatorial Algorithms, Lecture Notes in Computer Science, Springer, no. 7643, pp. 293-302, 2012.

459. D. Sarioz, Approximating the obstacle number for a graph drawing efficiently, Proceedings of the Canadian Conference on Computational Geometry, pp. 1-6, 2011.

460. R. Sawhney, M. Krishna, and K. Srinathan, On fast exploration in 2D and 3D terrains with multiple robots, Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems, Budapest, pp. 73-80, 2009.

461. M. Schmidt and P. Valtr, Cubic plane graphs on a given point set, Computational Geometry: Theory and Applications, vol. 48, pp. 1-13, 2015.

462. S. Schuierer, Computing the L1-diameter and center of a simple rectilinear polygon in parallel, Proceedings of the 4th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, no. 824, Springer-Verlag, pp. 326-337, 1994.

463. A. Sengupta, R. Ray and S. N. Shome, Virtual stretched string: An optimal path planning tech- nique over polygonal obstacles, Proceedings of Conference on Advances in Robotics, pp. 1-5, 2013.

464. S. Y. Shin and T. C. Woo, Finding the convex hull of a simple polygon in linear time, Pattern Recognition, vol. 19, pp. 453-458, 1986.

465. I. Shnaps and E. Rimon, Online coverage by a tethered autonomous mobile robot in planar unknown environments, IEEE Transactions on Robotics, vol. 30, no. 4, pp. 966-974, 2014.

466. I. Shnaps and E. Rimon, On-line coverage of planar environments by a battery powered autonomous mobile robot, Proceedings of the Workshop on the Algorithmic foundations of Robotics, 2014.

467. G. Srinivasaraghavan and A. Mukhopadhyay, A new necessary condition for the vertex visibility graphs of simple polygons, Discrete and Computational Geometry, vol. 12, pp. 65-82, 1994.

468. G. Srinivasaraghavan and A. Mukhopadhyay, Orthogonal edge visibility graphs of polygons with holes, International Journal of Computational Geometry and Applications, vol. 10, pp. 79-102, 2000.

469. R. Stephane, Topologically sweeping the visibility complex of polygonal scenes, Proceedings of the ACM Symposium on Computational Geometry, pp. C36-37, 1995.

470. I. Streinu, Non-stretchable Pseudo-Visibility Graphs, Computational Geometry: Theory and Applications, vol. 31, pp. 195-206, 2005.

471. I. Streinu, Stretchibility of star-like pseudo-visibility graphs, Proceedings of the ACM Symposium on Computational Geometry, pp. 274-280, 1999.

472. E. Stump, N. Michael, V. Kumar and V. Isler, Visibility-based deployment of robot formations for communication maintenance, Proceedings of IEEE International Conference on Robotics and Automation, pp. 4498-4505, 2011.

473. S. Suri, E. Vicari and P. Widmayer, Simple robots with minimal sensing: From local visibility to global geometry, The International Journal of Robotics Research, vol. 27, no. 9, pp. 1055-1067, 2008.

474. A Tabatabaei and M Ghodsi, Walking in streets with minimum sensing, Proceedings of 7th Inter- national Conference on Combinatorial Optimization and Applications, Lecture Notes in Computer Science, Springer, no. 8287, pp. 361-372, 2013.

475. A Tabatabaei and M Ghodsi, Optimal strategy for walking in streets with minimum number of turns for a simple robot, Proceedings of 8th International Conference on Combinatorial Optimiza- tion and Applications, Lecture Notes in Computer Science, Springer, no. 8881, pp. 101-112, 2014.

476. X. Tan, An optimal algorithm for the 1-searchability of polygonal rooms, Proceedings of the Japanese Conference on Discrete Computational Geometry, Lecture Notes in Computer Science, Springer-Verlag, no. 3742, pp. 174-183, 2005.

477. X. Tan, A linear-time 2-approximation algorithm for the watchman route problem for simple polygons, Theoretical Computer Science, vol. 384, pp. 92-103, 2007.

478. X. Tan, A unified and efficient solution to the room search problem, Computational Geometry: Theory and Applications, vol. 40, no. 1, pp. 45-60, 2008.

479. X. Tan, An efficient algorithm for the three-guard problem, Discrete Applied Mathematics, vol. 156, no. 17, pp. 3312-3324, 2008.

480. X. Tan and B. Jiang, Searching a polygonal region by two guards, Journal of Computer Science and Technology, vol. 23, pp. 728-739, 2008.

481. X. Tan and B. Jiang, Minimization of the maximum distance between the two guards patrolling a polygonal region, Proceedings of Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, Lecture Notes in Computer Science, Springer, no. 7285, pp. 47-57, 2012.

482. X. Tan, B. Jiang and J. Zhang, Characterizing and recognizing LR-visibility polygons, Discrete Applied Mathematics, vol. 165, pp. 303-311, 2014.

483. X. Tan, J. Zhang and B. Jiang, Simple characterization of LR-visibility polygons, Proceedings of the 9th International Conference on Computational Geometry, Graphs and Applications, Lecture Notes in Computer Science, Springer, no. 7033, pp. 176-187, 2011.

484. X. Tan, J. Zhang and B. Jiang, A characterization of link-2 LR-visibility polygons with applica- tions, Proceedings of the 16th Japanese Conference on Discrete and Computational Geometry and Graphs, Lecture Notes in Computer Science, no. 8845, Springer, pp. 161-172, 2013.

485. P.J. Tanenbaum, M.T. Goodrich and E.R. Scheinerman, Characterization and recognition of point-halfspace and related orders , Proceedings of Graph Drawing: DIMACS International Workshop, Lecture Notes in Computer Science, Springer-Verlag, no. 894, pp. 234-245, 1994.

486. P. Tobola and K. Nechvile, Local approach to dynamic visibility in the plane, Proceedings of the 7th International Conference in Central Europe on Computer Graphics, Visualization and Interactive Digital Media'99 (WSCG '99), pp. 202-208, 1999.

487. A. P. Tomas, Guarding thin orthogonal polygons is hard, Proceedings of Foundamental of Computation Theory, Lecture Notes in Computer Science, Springer-Verlag, no. 8070, pp. 305-316, 2013.

488. A. P. Tomas, A. L. Bajuelos, F. Marques, Approximation algorithms to minimum vertex cover problems on polygons and terrains, Proceedings of International Conference on Computational Science, Lecture Notes in Computer Science, no. 2657, Springer-Verlag, pp. 869-878, 2003.

489. A. P. Tomas, A. L. Bajuelos, F. Marques, On visibility problems in the plane -- solving minimum vertex guard problems by successive approximations, Proceedings of the 9th International Symposium on Artificial Intelligence and Mathematics, pp. 1-12, 2006.

490. D Tozoni, PJ de Rezende, C. de Souza, The quest for optimal solutions for the art gallery problem: A practical iterative algorithm, Proceedings of the 12th International Symposium on Experimental Algorithms, pp. 320-336, 2013.

491. N. Tran, C.-T. Nguyen, D.-L. Vu and T. Van Hoai, Embedded-oriented techniques for 2D short- est trajectory planning to avoid restricted airspaces, Proceedings of International Symposium on Communications and Information Technologies (ISCIT), pp. 238-242, 2014.

492. N. C. Tsourveloudis, K.P. Valavanis and T. Hebert, Autonomous vehicle navigation utilizing electrostatic potentialfields and fuzzy logic , IEEE Transactions on Robotics and Automation, vol. 17, pp. 490-497, 2001.

493. K.P. Valavanis, T. Hebert, R. Kolluru and N. C. Tsourveloudis, Mobile robot navigation in 2-D dynamic environments using anelectrostatic potential field, IEEE Transactions on Systems, Man and Cybernetics, Part A, vol. 30, pp. 187-196, 2000.

494. W. Van Toll, A. F. Cook and R. Geraerts, Navigation meshes for realistic multi-layered environments, IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 3526- 3532, 2011.

495. G. Varadhan, S. Krishnan, T. V.N. Sriram and D. Manocha, A simple algorithm for complete motion planning of translating polyhedral robots , The International Journal of Robotics Research, vol. 25, pp. 1049-1070, 2006.

496. G. Vegter, Dynamically maintaining the visibility graph, Proceedings of the Conference on Algorithms and Data Structures, Lecture Notes in Computer Science, Springer-Verlag, no. 519, pp. 425-436, 1991.

497. G. Viglietta, Face-guarding polyhedra, Computational Geometry:Theory and Applications, vol. 48, no. 5, pp. 415-428, 2015.

498. M. Vigo, N. Pla, D. Ayala and J. Martinez, Efficient algorithms for boundary extraction of 2D and 3D orthogonal pseudomanifolds, Graphical Models, vol. 74, pp. 61-74, 2012.

499. B.-F. Wang, Tight bounds on the solution of a divide-and-conquer maximin recurrence, Journal of Algorithms, vol. 23, pp. 329-344, 1997.

500. B.-F. Wang, Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences, Theoretical Computer Science, vol. 242, pp. 377-401, 2000.

501. C. A. Wang and B. Zhu, Three dimensional weak visibility: complexity and applications , Theoretical Computer Science, vol. 234, pp. 219--232, 2000.

502. P. Wang, R. Krishnamurti and K. Gupta, Generalized watchman route problem with discrete view cost, Proceedings of the 19th Annual Canadian Conference on Computational Geometry, pp. 241-244, 2007.

503. R. Wein, J. van den Berg and D. Halperin, The visibility-voronoi complex and its applications, Computational Geometry: Theory and Applications, vol. 36, pp. 66-87, 2007.

504. S. K. Wismath, Computing the full visibility graph of a set of line segments, Information Processing Letters, vol. 42, pp. 257-261, 1992.

505. D. Wooden and M. Egerstedt, Oriented visibility graphs: Low-complexity planning in real-time environments, Proceedings of the IEEE International Conference on Robotics and Automation, pp. 2354-2359, 2006.

506. O.J. Woodman and R.K. Harle, Concurrent scheduling in the Active Bat location system, Proceedings of the 8th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM), pp. 431-437, 2010.

507. M. Wybrow, K. Marriott and P. J. Stuckey, Incremental connector routing, Proceedings of the 13th International Symposium on Graph Drawing, Lecture Notes in Computer Science, Springer-Verlag, no. 3843, pp. 446-457, 2005.

508. E. Wynters and J. Mitchell, Shortest paths for a two-robot rendez-vous, Proceedings of the fifth Canadian Conference on Computational Geometry, pp. 216-221, 1993.

509. S. Xie, View planning for mobile robots, Proceedings of IEEE International Conference on Robotics and Automation, vol. 2, pp. 748-754, 1990.

510. J. Xiao, H. Wang and N. Xi, Intelligent control for wall climbing robot, Proceedings of the 21st Annual International Conference on Chinese Control and Decision Conference, Guilin, pp. 1391-1396, 2009.

511. J. Xiao, J. Z. Xiao, N. Xi, R. L. Tummala and R. Mukherjee, Fuzzy controller for wall-climbing microrobots , IEEE Transactions on Fuzzy Systems, vol. 12, pp. 466-480, 2004.

512. J. Xu and R. H. G ̈ting, Querying visible points in large obstructed space, Goinformatica, Published Online, 2014.

513. Q. Xu, J. Tremblay and C. Verbrugge, Generative Methods for Guard and Camera Placement in Stealth Games, Proceedings of the Tenth Annual AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, pp. 87-93, 2014.

514. C.-L. Yang, W.-Z. Wang, Y.-J. Yang, L. Lu, Z.-J. Zhu, B. Zhu and W. Zeng, Weak visibility polygons of {NURBS} curves inside simple polygons, Journal of Computational and Applied Mathematics, vol. 256, pp. 1-15, 2014.

515. S. Yusoff, A. Said and I. Ismail, Optimal camera placement for 3D environment, Proceedings of the 2nd International Conference on Software Engineering and Computer Systems, Communications in Computer and Information Science, Springer, vol. 180, pp. 448-459, 2011.

516. M. Zambon, P. J. de Rezende and C. C. de Souza, An exact algorithm for the discrete chromatic art gallery problem, Proceedings of the 13th International Symposium on Experimental Algorithms, pp. 59-73, 2014.

517. A. Zarei and M. Ghodsi, A practical approach for planar visibility maintenance, Journal of Geometry and Graphics, vol. 13, pp. 75-90, 2009.

518. O. Zedadra, H. Seridi, N. Jouandeau, and G. Fortino, S-MASA: A stigmergy based algorithm for multi-target search, Proceedings of Federated Conference on Computer Science and Information Systems (FedCSIS), pp. 1477-1485. IEEE, 2014.

519. S. Zeghloul, C. Helguera and G. Ramirez, A local-based method for manipulators path planning using sub-goals resulting from a local graph, Robotica, vol. 24, pp. 539--548, 2006.

520. J. Z. Zhang, On searchability and LR-visibility of polygons, Advances and Innovations in Systems, Computing Sciences and Software Engineering (Editor: K. Elleithy), Springer, pp. 223-228, 2007.

521. J. Zhang and T. Kameda, Where to build a door, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 4084-4090, 2006.

522. J. Zhang and T. Kameda, A linear-time algorithm for finding all door locations that make a room searchable, Proceedings of the 5th International Conference on Theory and Applications of Models of Computation, Lecture Notes in Computer Science, Springer, no. 4978, pp. 502-513, 2008.

523. J. Zhang, D Papadias, K Mouratidis and Z. Manli, Spatial queries in the presence of obstacles, Proceedings of the 9th International Conference on Extending Database Technology, Lecture Notes in Computer Science, Springer-Verlag, no. 2992, pp. 366-384, 2004.

524. J. Zhang, D. Papadias, K. Mouratidis and Z. Manli, Query processing in spatial databases containing obstacles, International Journal of Geographical Information Science, vol. 19, pp. 1091 - 1111, 2005.