Author:
Ashur Stav,Filtser Omrit,Katz Matthew J.
Publisher
Springer International Publishing
Reference28 articles.
1. Abrahamsen, M., Adamaszek, A., Miltzow, T.: The art gallery problem is $$\exists $$$$\mathbb{R}$$-complete. In: Proceedings of the 50th ACM SIGACT Sympos. on Theory of Computing, STOC, pp. 65–73 (2018)
2. Aggarwal, A.: The art gallery theorem: its variations, applications and algorithmic aspects. Ph.D. thesis, Johns Hopkins University (1984)
3. Ashur, S., Filtser, O., Katz, M.J., Saban, R.: Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains. In: Proceedings of the 17th Workshop on Approximation and Online Algorithms, WAOA, pp. 1–17 (2019)
4. Avis, D., Toussaint, G.T.: An optimal algorithm for determining the visibility of a polygon from an edge. IEEE Trans. Comput. 30(12), 910–914 (1981)
5. Bhattacharya, P., Ghosh, S.K., Pal, S.: Constant approximation algorithms for guarding simple polygons using vertex guards. arXiv:1712.05492 (2017)