An efficient algorithm for decomposing a polygon into star-shaped polygons, Pattern Recognition, vol.13, issue.6, pp.395-39839, 1975. ,

DOI : 10.1016/0031-3203(81)90002-9

A Pseudopolynomial Time O(log copt)-Approximation Algorithm for Art Gallery Problems, WADS, pp.163-174, 2007. ,

Sweeping simple polygons with a chain of guards, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pp.927-936, 2000. ,

Inapproximability Results for Guarding Polygons and Terrains A short proof of Chvatals watchman theorem Maximizing the guarded boundary of an Art Gallery is APX-complete Computational Geometry: Theory and Applications Approximation algorithms for art gallery problems Kranakis and M. Pocchiola. Camera placement in integer lattices Guarding the walls of an art gallery. The Visual Computer The minimum cooperative guards problem on k-spiral polygons Art gallery theorems for guarded guards, Stationing guards in rectilinear art galleries. Computer vision, graphics, and image processing Proc. Canadian Inform. Process. Soc. Congress Traditional Galleries Require Fewer Watchmen. SIAM Journal on Algebraic and Discrete Methods Proc. of Fifth Canadian Conference on Computational GeometryMP03] T. Michael and V. Pinciu, pp.167-17679, 1976. ,

An alternate proof of the rectilinear art gallery theorem, PV96] M. Pocchiola and G. Vegter. Pseudo-triangulations: theory and applications. Proceedings of the twelfth annual symposium on Computational geometry, pp.118-130, 1983. ,

DOI : 10.1007/BF01918136

An O (n log n) algorithm for decomposing simple rectilinear polygons into convex quadrilaterals, Proceedings 20th Conference on Communications, Control, and Computing, pp.64-74, 1982. ,

Allocating Vertex p-Guards in Simple Polygons via Pseudo- Triangulations. Discrete and Computational Geometry Recent results on illumination problems Illumination of convex discs, Proceedings of the IEEEUrr00] J. Urrutia. Art gallery and illumination problems. Handbook of Computational Geometry, pp.1384-1399345, 1977. ,