SBC - Proceedings of SBGamesComputing Track – Full Papers Coverage in Arbitrary 3D Environments The Art Gallery Problem in Shooter Games

Source URL: www.sbgames.org

How to Place Efficiently Guards and Paintings in an Art Gallery Christodoulos Fragoudakis∗†, Euripides Markou∗‡ and Stathis Zachos§ April 25, 2005 Abstract

Source URL: emarkou.users.uth.gr

• Geometry
• Polygons
• Mathematics
• Space
• Art gallery problem
• Polygon
• Vertex
• Convex polygon
• Simple polygon
• Star polygon
• Visibility graph
• Knapsack problem

Maximizing the Guarded Interior of an Art Gallery Ioannis Emiris∗ Christodoulos Fragoudakis† (Θ(log n)–approximable [6], [3], [4]). In [7] the case

Source URL: emarkou.users.uth.gr

• Geometry
• Polygons
• Mathematics
• Art gallery problem
• Simple polygon
• Visibility polygon

Growing and Shrinking Polygons for Random Testing of Computational Geometry Algorithms Experience Report Ilya Sergey University College London, UK

Source URL: ilyasergey.net

• Polygons
• Geometry
• Mathematics
• Polygon triangulation
• Simple polygon
• Visibility polygon
• Polygon
• Art gallery problem
• Triangulation
• Star-shaped polygon
• Rectilinear polygon
• Star polygon

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

Source URL: emarkou.users.uth.gr

• Mathematics
• Computational complexity theory
• Geometry
• Polygons
• NP-complete problems
• Euclidean plane geometry
• Art gallery problem
• Computational geometry
• Vertex
• APX

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

Source URL: emarkou.users.uth.gr

• Mathematics
• Geometry
• Graph theory
• Polygons
• Computational geometry
• Euclidean plane geometry
• Art gallery problem
• Vertex
• Visibility graph
• Visibility polygon
• Pseudotriangle

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

Source URL: emarkou.users.uth.gr

• Polygons
• NP-complete problems
• Computational problems
• Computational geometry
• Combinatorial optimization
• Art gallery problem
• Visibility graph
• Simple polygon
• Clique
• Cut
• Optimization problem
• Polygon covering

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

Source URL: emarkou.users.uth.gr

• Polygons
• Computational geometry
• Approximation algorithms
• Art gallery problem
• APX
• Vertex

CEOC Centro de Estudos em Optimização e Controlo (Centre for Research in Optimization and Control) Computability and Algorithms

Source URL: ceoc.mat.ua.pt

• Theoretical computer science
• Quantum computing
• Quantum information science
• Computational complexity theory
• Quantum algorithm
• Algorithm
• Computational geometry
• Computational mathematics
• Complexity
• Quantum simulator
• Art gallery problem

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

Source URL: cs.smith.edu