Author:
Alipour Sharareh,Parsa Salman
Publisher
Springer International Publishing
Reference31 articles.
1. Abam, M.A., Alipour, S., Ghodsi, M., Mahdian, M.: Visibility testing and counting for uncertain segments. Theor. Comput. Sci. 779, 1–7 (2019)
2. Asano, T.: An improved analysis of Goemans and Williamson’s LP-relaxation for MAX SAT. Theor. Comput. Sci. 354(3), 339–353 (2006)
3. Asano, T., Williamson, D.P.: Improved approximation algorithms for MAX SAT. J. Algorithms 42(1), 173–202 (2002)
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. Ben-Moshe, B., Hall-Holt, O.A., Katz, M.J., Mitchell, J.S.B.: Computing the visibility graph of points within a polygon. In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, 8–11 June 2004, pp. 27–35 (2004)