Computing the largest empty convex subset of a set of points, Proceedings of the first annual symposium on Computational geometry , SCG '85, pp.161-167, 1985. ,
DOI : 10.1145/323233.323255
Computing optimal islands, Operations Research Letters, vol.39, issue.4, pp.246-251, 2011. ,
DOI : 10.1016/j.orl.2011.04.008
Triangulating a simple polygon in linear time, Discrete & Computational Geometry, vol.15, issue.3, pp.485-524, 1991. ,
DOI : 10.1007/BF02574703
Sequential and parallel algorithms for finding a maximum convex polygon, Computational Geometry, vol.7, issue.3, pp.187-200, 1997. ,
DOI : 10.1016/0925-7721(95)00035-6
Unsolved problems in visibility graphs of points, segments, and polygons, ACM Comput. Surv, vol.46, issue.2, p.22, 2013. ,
On recognizing and characterizing visibility graphs of simple polygons, Discrete & Computational Geometry, vol.12, issue.(3), pp.143-162, 1997. ,
DOI : 10.1007/BF02770871
Visibility Algorithms in the Plane, 2007. ,
An output-sensitive algorithm for computing visibility graphs, SIAM J. Comput, vol.20, issue.5, pp.888-910, 1991. ,
Computing the maximum clique in the visibility graph of a simple polygon, Journal of Discrete Algorithms, vol.5, issue.3, pp.524-532, 2007. ,
DOI : 10.1016/j.jda.2006.09.004
An optimal visibility graph algorithm for triangulated simple polygons, Algorithmica, vol.20, issue.No. 1, pp.141-155, 1989. ,
DOI : 10.1007/BF01553883