CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Generalized Watchman Route Problem with Discrete View Cost Pengpeng Wang∗, 1

First Page		Document Content
Date: 2008-10-28 21:28:16 Polygons NP-complete problems Computational geometry Operations research 3D computer graphics Art gallery problem Simple polygon Travelling salesman problem Visibility Geometry Mathematics Theoretical computer science		CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Generalized Watchman Route Problem with Discrete View Cost Pengpeng Wang∗, 1 Add to Reading List Source URL: cccg.ca Download Document from Source Website File Size: 98,46 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