CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Covering Orthogonal Polygons with Sliding k-transmitters Salma Sadat Mahdavi∗ Saeed Seddighin

First Page		Document Content
Date: 2014-08-05 11:21:00 Complexity classes Polygons Structural complexity theory Mathematical optimization Art gallery problem Approximation algorithm Reduction NP-complete Optimization problem Theoretical computer science Computational complexity theory Applied mathematics		CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Covering Orthogonal Polygons with Sliding k-transmitters Salma Sadat Mahdavi∗ Saeed Seddighin Add to Reading List Source URL: www.cccg.ca Download Document from Source Website File Size: 140,20 KB Share Document on Facebook

	SBC - Proceedings of SBGamesComputing Track – Full Papers Coverage in Arbitrary 3D Environments The Art Gallery Problem in Shooter Games DocID: 1uJca - View Document
	How to Place Efficiently Guards and Paintings in an Art Gallery Christodoulos Fragoudakis∗†, Euripides Markou∗‡ and Stathis Zachos§ April 25, 2005 Abstract DocID: 1r85C - View Document
	Maximizing the Guarded Interior of an Art Gallery Ioannis Emiris∗ Christodoulos Fragoudakis† (Θ(log n)–approximable [6], [3], [4]). In [7] the case DocID: 1qETY - View Document
	Growing and Shrinking Polygons for Random Testing of Computational Geometry Algorithms Experience Report Ilya Sergey University College London, UK DocID: 1q1E0 - View Document
	Maximizing the Guarded Boundary of an Art Gallery is APX-complete Euripides Markou1, Stathis Zachos1,2 and Christodoulos Fragoudakis1 1 Computer Science, ECE, National Technical University of Athens DocID: 1q0JO - View Document