The Art Gallery Problem

Slides:



Advertisements
Similar presentations
CS 336 March 19, 2012 Tandy Warnow.
Advertisements

Polygon Triangulation
Convex drawing chapter 5 Ingeborg Groeneweg. Summery What is convex drawing What is convex drawing Some definitions Some definitions Testing convexity.
 Distance Problems: › Post Office Problem › Nearest Neighbors and Closest Pair › Largest Empty and Smallest Enclosing Circle  Sub graphs of Delaunay.
Brute-Force Triangulation
EECS 4101/5101 Prof. Andy Mirzaian. References: [M. de Berge et al ’00] chapter 3 [Preparata-Shamos’85] chapter 6 [O’Rourke’98] chapter 1 [M. de Berge.
2/3/15CMPS 3130/6130 Computational Geometry1 CMPS 3130/6130 Computational Geometry Spring 2015 Triangulations and Guarding Art Galleries II Carola Wenk.
UNC Chapel Hill M. C. Lin Polygon Triangulation Chapter 3 of the Textbook Driving Applications –Guarding an Art Gallery –3D Morphing.
POLYGON TRIANGULATION POLYGON TRIANGULATION THE ART GALERY PROBLEM SİNEM GETİR COMPUTER GRAPHIC SEMINAR FEBRUARY 4, 2009.
The Maths of Pylons, Art Galleries and Prisons Under the Spotlight John D. Barrow.
Feb Polygon Triangulation Shmuel Wimer Bar Ilan Univ., School of Engineering.
ADA: 16. CG Topics1 Objective o an examination of four important CG topics o just a taster of a very large research area Algorithm Design and Analysis.
G UARDING A RT G ALLERY By: Venkatsai Bhimanthini Fall’2014.
Applied Combinatorics, 4th Ed. Alan Tucker
Steps in DP: Step 1 Think what decision is the “last piece in the puzzle” –Where to place the outermost parentheses in a matrix chain multiplication (A.
3. Delaunay triangulation
Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 1 Polygon Triangulation Motivation: Guarding art galleries Art gallery theorem.
Applied Combinatorics, 4th Ed. Alan Tucker
Computational Geometry Seminar Lecture 1
Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann Polygon Triangulation Motivation: Guarding art galleries Art gallery theorem.
Polygon Triangulation Computational Geometry, WS 2007/08 Lecture 9 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät.
Art Gallery Theorem Computational Geometry, WS 2006/07 Lecture 8, Part 1 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik.
The Art Gallery Problem
Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.
Brute-Force Triangulation
The Art Gallery Problem
9/7/06CS 6463: AT Computational Geometry1 CS 6463: AT Computational Geometry Fall 2006 Triangulations and Guarding Art Galleries Carola Wenk.
CENG 789 – Digital Geometry Processing 02- Polygons and Triangulations Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.
Pylon of the Month Rigidity  Division leads to more boundary  cut Division Can be Dangerous.
Graph Colouring L09: Oct 10. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including the famous.
Computational Geometry Polygon Triangulation and The Art Gallery Problem Joachim Gudmundsson NICTA, Sydney.
Unit – V Graph theory. Representation of Graphs Graph G (V, E,  ) V Set of vertices ESet of edges  Function that assigns vertices {v, w} to each edge.
Graph Theory and Applications
1/29/15CMPS 3130/6130 Computational Geometry1 CMPS 3130/6130 Computational Geometry Spring 2015 Triangulations and Guarding Art Galleries Carola Wenk.
The Art Gallery Problem Bart Verzijlenberg. Agenda Problem Problem Chvátal’s Classical Art Gallery Theorem Chvátal’s Classical Art Gallery Theorem Proof.
Contest Algorithms January 2016 Triangulation & the Art Gallery Problem Contest Algorithms1.
Great Theoretical Ideas in Computer Science for Some.
9/8/10CS 6463: AT Computational Geometry1 CS 6463: AT Computational Geometry Fall 2010 Triangulations and Guarding Art Galleries Carola Wenk.
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 9 Line Arrangements.
COMPSCI 102 Introduction to Discrete Mathematics.
Polygon Triangulation
CHAPTER SIX T HE P ROBABILISTIC M ETHOD M1 Zhang Cong 2011/Nov/28.
Trees.
Graphs. Representations of graphs : undirected graph An undirected graph G have five vertices and seven edges An adjacency-list representation of G The.
Hamiltonian Graphs Graphs Hubert Chan (Chapter 9.5)
CMPS 3130/6130 Computational Geometry Spring 2017
3. Polygon Triangulation
Algorithms and Networks
Great Theoretical Ideas In Computer Science
Planar Graphs Hubert Chan (Chapter 9.7) [O2 Proof Techniques]
Outline 1 Properties of Planar Graphs 5/4/2018.
CENG 789 – Digital Geometry Processing 02- Polygons and Triangulations
Advanced Algorithms Analysis and Design
Applied Combinatorics, 4th Ed. Alan Tucker
Hamiltonian Graphs Graphs Hubert Chan (Chapter 9.5)
Algorithms and Networks
Great Theoretical Ideas in Computer Science
COMP 6/4030 ALGORITHMS Prim’s Theorem 10/26/2000.
Tucker, Applied Combinatorics, Sec 2.4
Planarity Testing.
Discrete Mathematics for Computer Science
The Art Gallery Problem
Polygon Triangulation
Depth Estimation via Sampling
Convex Sets & Concave Sets
Applied Combinatorics, 4th Ed. Alan Tucker
SPQR Tree.
Computational Geometry
Discrete Mathematics for Computer Science
Overlay of Two Subdivisions
Presentation transcript:

The Art Gallery Problem camera How many cameras are needed to guard a gallery and How should they be placed?

Simple Polygon Model Model the art gallery as a region bounded by some simple polygon (no self-crossing). Regions with holes are not allowed. convex polygon one camera an arbitrary n-gon (n vertices) Bad news: finding the minimum number of cameras for a given polygon is NP-hard (exponential time).

Triangulation To make things easier, we decompose a polygon into pieces that are easy to guard. Guard the polygon by placing a camera in every triangle … Draw diagonals between pair of vertices. an open line segment that connects two vertices and lie in the interior of the polygon. Triangulation: decomposition of a polygon into triangles by a maximal set of non-intersecting diagonals.

# Triangles Theorem 1 Every simple polygon has a triangulation. Any triangulation of a simple polygon with n vertices consists of exactly n – 2 triangles. Proof By induction. Trivial for n = 3. Assume true for all m < n. Existence Let v be the leftmost vertex and u and w its two neighbors. u v w P  uw in the interior of P  it is a diagonal. v w u v  Otherwise, the triangle determined by u, v, w contains at least one vertex. Let v be the one closest to v. Then vv is a diagonal. The diagonal splits the polygon into two (which by induction can be triangulated).

Proof (cont’d) # triangles = n – 2 Any diagonal splits P into two simple polygons with k and m vertices, respectively. By induction these two subpolygons can be triangulated. They are decomposed into k – 2 and m – 2 triangles, resp. Vertices defining the diagonal occur in each subpolygon once. Other vertices of P each occurs in exactly on one subpolygon. Thus k + m = n + 2. By induction, the triangulation of P has (k – 2) + (m – 2) = n – 2 triangles.

# Cameras for AG Theorem 1  n – 2 cameras can guard the simple polygon. A camera on a diagonal guards two triangles.  # cameras can be reduced to roughly n/2. A vertex is adjacent to many triangles. So placing cameras at vertices can do even better …

3-Coloring Idea: Select a set of vertices, such that any triangle has at least one selected vertex. Assign each vertex a color: pink, green, or yellow. Any two vertices connected by an edge or a diagonal must be assigned different colors. Thus the vertices of every triangle will be in three different colors. If 3-coloring exists, place cameras at all vertices of the same color. Choose the smallest color class to place the cameras.  n/3 cameras.

The Dual Graph Thus the dual graph is a tree. Dual graph G has a node inside every triangle and an edge between every pair of nodes whose corresponding triangles share a diagonal. G is connected. Any diagonal cuts the polygon into two. Every diagonal corresponds to an edge in the dual graph. Removal of any edge from the dual graph disconnects it.  Thus the dual graph is a tree.

A 3-Coloring Algorithm A 3-coloring can be found through a graph traversal (such as DFS). During DFS, maintain the invariant: All polygon vertices of encountered triangles have been colored such that no adjacent two have the same color. u Start DFS at any node of G. Color the three vertices of the corresponding triangle. v Suppose node v is visited from u.  Their triangles T(v) and T(u) are adjacent. Only one vertex of T(v) is not colored.  Its color is uniquely determined. Since G is a tree, the other nodes adjacent to v have not been visited yet. Otherwise there exists a cycle (which contradicts that G is a tree.)  Apply the color to v.

A Worst Case The 3-coloring approach is optimal in the worst case. A triangulated polygon can always be 3-colored.  Any simple polygon can be guarded with n/3 cameras. n/3 prongs There exists no position at which a camera can oversee two prongs. n/3 cameras are needed. The 3-coloring approach is optimal in the worst case.

Art Gallery Theorem For a simple polygon with n vertices, n/3 cameras are sufficient to have every interior point visible from at least one of the cameras. Solution to the Art Gallery Problem 1. Triangulate a simple polygon with a fast algorithm. DCEL representation for the simple polygon so we can visit a neighbor from a triangle in constant time. 2. Generate a 3-coloring by DFS (as presented earlier). 3. Take the smallest color class to place the cameras.