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

First Page		Document Content
Date: 2016-05-24 11:28:43 Mathematics Computational complexity theory Geometry Polygons NP-complete problems Euclidean plane geometry Art gallery problem Computational geometry Vertex APX		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 Add to Reading List Source URL: emarkou.users.uth.gr Download Document from Source Website File Size: 158,66 KB Share Document on Facebook

	Hillshade from Kenai Peninsula Borough GIS division. Wetland mapping polygons from Kenai Watershed Forum. Wetland functional assessment by Homer Soil & Water Conservation District (HSWCD), 2014. Map prepared by Karyn Noy DocID: 1vqFm - View Document
	Hillshade from Kenai Peninsula Borough GIS division. Wetland mapping polygons from Kenai Watershed Forum. Wetland functional assessment by Homer Soil & Water Conservation District (HSWCD), 2014. Map prepared by Karyn Noy DocID: 1vnxa - View Document
	Reconstructing Generalized Staircase Polygons with Uniform Step Length Nodari Sitchinava and Darren Strash GD 2017 \| Sept. 25, 2017 Department of Computer Science Colgate University DocID: 1uGjf - View Document
	Experience Report: Growing and Shrinking Polygons for Random Testing of Computational Geometry Algorithms Ilya Sergey University College London, UK DocID: 1uCcz - View Document
	Patulous Pegboard Polygons Derek Kisman, Richard Guy & Alex Fink May 9, 2006 A problem in a recent competition was: Given a 2004 by 2004 square grid of dots, what is the largest number of edges of a DocID: 1uBd3 - View Document