Art gallery problem - PDFSEARCH.IO - Document Search Engine

Art gallery problem
Results: 63

#	Item
1	SBC - Proceedings of SBGamesComputing Track – Full Papers Coverage in Arbitrary 3D Environments The Art Gallery Problem in Shooter Games Add to Reading List Source URL: www.sbgames.org Language: English - Date: 2013-10-25 13:12:56
2	How to Place Efficiently Guards and Paintings in an Art Gallery Christodoulos Fragoudakis∗†, Euripides Markou∗‡ and Stathis Zachos§ April 25, 2005 Abstract Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:43 Geometry Polygons Mathematics Space Art gallery problem Polygon Vertex Convex polygon Simple polygon Star polygon Visibility graph Knapsack problem
3	Maximizing the Guarded Interior of an Art Gallery Ioannis Emiris∗ Christodoulos Fragoudakis† (Θ(log n)–approximable [6], [3], [4]). In [7] the case Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:43 Geometry Polygons Mathematics Art gallery problem Simple polygon Visibility polygon
4	Growing and Shrinking Polygons for Random Testing of Computational Geometry Algorithms Experience Report Ilya Sergey University College London, UK Add to Reading List Source URL: ilyasergey.net Language: English - Date: 2016-08-16 07:30:03 Polygons Geometry Mathematics Polygon triangulation Simple polygon Visibility polygon Polygon Art gallery problem Triangulation Star-shaped polygon Rectilinear polygon Star polygon
5	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 Language: English - 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
6	Budgeted Coverage of a Maximum Part of a Polygonal Area 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 Language: English - Date: 2016-05-24 11:28:43 Mathematics Geometry Graph theory Polygons Computational geometry Euclidean plane geometry Art gallery problem Vertex Visibility graph Visibility polygon Pseudotriangle
7	Approximating Visibility Problems within a Constant E. M ARKOU Computer Science, ECE, National Technical University of Athens, Greece C. F RAGOUDAKIS Computer Science, ECE, National Technical University of Athens, Greece Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:43 Polygons NP-complete problems Computational problems Computational geometry Combinatorial optimization Art gallery problem Visibility graph Simple polygon Clique Cut Optimization problem Polygon covering
8	Maximizing the Guarded Boundary of an Art Gallery is APX-complete ⋆ Christodoulos Fragoudakis a , Euripides Markou b,∗,1,2 , Stathis Zachos a,c a Computer b Department Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:44 Polygons Computational geometry Approximation algorithms Art gallery problem APX Vertex
9	CEOC Centro de Estudos em Optimização e Controlo (Centre for Research in Optimization and Control) Computability and Algorithms Add to Reading List Source URL: ceoc.mat.ua.pt Language: English - Date: 2008-07-17 10:24:20 Theoretical computer science Quantum computing Quantum information science Computational complexity theory Quantum algorithm Algorithm Computational geometry Computational mathematics Complexity Quantum simulator Art gallery problem
10	EXTERIOR VISIBILITYINTRODUCTION Derick Wood and Joseph Malkelvitch independently posed two interesting variants of the original Art Gallery Problem, which Wood dubbed The Fortress Problem and The Prison Yard Probl Add to Reading List Source URL: cs.smith.edu Language: English - Date: 2008-12-17 15:05:26

UPDATE