Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 1 Polygon Triangulation Motivation: Guarding art galleries Art gallery theorem.

Slides:



Advertisements
Similar presentations
Polygon Triangulation
Advertisements

 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.
Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann Triangulation (Naive)
POLYGON TRIANGULATION POLYGON TRIANGULATION THE ART GALERY PROBLEM SİNEM GETİR COMPUTER GRAPHIC SEMINAR FEBRUARY 4, 2009.
9/12/06CS 6463: AT Computational Geometry1 CS 6463: AT Computational Geometry Fall 2006 Triangulations and Guarding Art Galleries II Carola Wenk.
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.
Problems in Ramsey theory typically ask a question of the form: "how many elements of some structure must there be to guarantee that a particular property.
Zoo-Keeper’s Problem An O(nlogn) algorithm for the zoo-keeper’s problem Sergei Bespamyatnikh Computational Geometry 24 (2003), pp th CGC Workshop.
Face Guards for Art Galleries Diane Souvaine, Raoul Veroy, and Andrew Winslow Tufts University.
G UARDING A RT G ALLERY By: Venkatsai Bhimanthini Fall’2014.
Applied Combinatorics, 4th Ed. Alan Tucker
Convex Hulls Computational Geometry, WS 2006/07 Lecture 2 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät für.
3. Delaunay triangulation
Delaunay Triangulation Computational Geometry, WS 2006/07 Lecture 11 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät.
1 Lecture 8: Voronoi Diagram Computational Geometry Prof. Dr. Th. Ottmann Voronoi Diagrams Definition Characteristics Size and Storage Construction Use.
Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 1 l-Monotone Convex polygons are easy to triangulate. Unfortunately the partition.
Duality and Arrangements Computational Geometry, WS 2007/08 Lecture 6 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät.
What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.
Computational Geometry Seminar Lecture 1
Lecture 10 : Delaunay Triangulation Computational Geometry Prof. Dr. Th. Ottmann 1 Overview Motivation. Triangulation of Planar Point Sets. Definition.
Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann Polygon Triangulation Motivation: Guarding art galleries Art gallery theorem.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2004 Lecture 2 Chapter 2: Polygon Partitioning.
Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.
Lecture 8 : Arrangements and Duality Computational Geometry Prof. Dr. Th. Ottmann 1 Duality and Arrangements Duality between lines and points Computing.
Point Location Computational Geometry, WS 2007/08 Lecture 5 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät für.
Art Gallery Problems Prof. Silvia Fernández. Star-shaped Polygons A polygon is called star-shaped if there is a point P in its interior such that the.
Polygon Triangulation Computational Geometry, WS 2007/08 Lecture 9 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät.
Lecture 6: Point Location Computational Geometry Prof. Dr. Th. Ottmann 1 Point Location 1.Trapezoidal decomposition. 2.A search structure. 3.Randomized,
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 Lecture 2 Chapter 2: Polygon Partitioning.
Polygon Triangulation Computational Geometry, WS 2006/07 Lecture 8, Part 2 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik.
Art Gallery Theorem Computational Geometry, WS 2006/07 Lecture 8, Part 1 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik.
Duality and Arrangements Computational Geometry, WS 2006/07 Lecture 7 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät.
The Art Gallery Problem
Brute-Force Triangulation
Computational Geometry Piyush Kumar (Lecture 4: Planar Graphs, Polygons and Art Gallery) Welcome to CIS5930.
The Art Gallery Problem
Graph Algorithms Using Depth First Search Prepared by John Reif, Ph.D. Distinguished Professor of Computer Science Duke University Analysis of Algorithms.
9/7/06CS 6463: AT Computational Geometry1 CS 6463: AT Computational Geometry Fall 2006 Triangulations and Guarding Art Galleries Carola Wenk.
Flow and Upward Planarity
Triangulating a monotone polygon
Planar Graphs: Euler's Formula and Coloring Graphs & Algorithms Lecture 7 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
CENG 789 – Digital Geometry Processing 02- Polygons and Triangulations Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.
Art gallery theorems for guarded guards T.S. Michael, Val Pinciub Computational Geometry 26 (2003) 247–258.
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.
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.
An Introduction to Computational Geometry Joseph S. B. Mitchell Stony Brook University.
Open Guard Edges and Edge Guards in Simple Polygons Csaba Tóth, Godfried Toussaint, and Andrew Winslow.
Introduction to Graph Theory
Contest Algorithms January 2016 Triangulation & the Art Gallery Problem Contest Algorithms1.
CLASSIFYING POLYGONS UNIT 1 LESSON 6. Classifying Polygons In geometry, a figure that lies in a plane is called a plane figure. A polygon is a closed.
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.
Polygon Triangulation
CMPS 3130/6130 Computational Geometry Spring 2017
3. Polygon Triangulation
Great Theoretical Ideas In Computer Science
CENG 789 – Digital Geometry Processing 02- Polygons and Triangulations
An Introduction to Computational Geometry
Tucker, Applied Combinatorics, Sec 2.4
The Art Gallery Problem
The Art Gallery Problem
Polygon Triangulation
Presentation transcript:

Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 1 Polygon Triangulation Motivation: Guarding art galleries Art gallery theorem for simple polygons Partitioning of polygons into monotone pieces Triangulation of y-monotone polygons

Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 2 Guarding art galleries “Art Gallery“ Problem Visibility polygon

Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 3 Guarding a triangulated polygon

Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 4 Triangulation of simple polygons w v u

Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 5 Theorem Theorem: Every simple polygon admits a triangulation, and any triangulation of a simple polygon with n vertices consists of exactly n-2 triangles. Proof:By induction on n. Let n>3, and assume theorem is true for all m<n. Let P be polygon with n vertices. We first prove the existence of a diagonal in P. Let v be leftmost vertex of P. Let u and v be two neighboring vertices of v. If uw lies in the interior of P we have found a diagonal. Else, there are one or more vertices inside the triangle defined by u, v, and w, or the diagonal uw. Let v´ be the farthest vertex from uw. The segment connecting v´ to v cannot intersect an edge of p (contradicts the definition of v´). Hence vv´ is a diagonal.

Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 6 Continuation of proof So a diagonal exists. Any diagonal cuts P in two simple sub- polygons P 1 and P 2. Let m 1 be the number of vertices of P 1 and m 2 the number of vertices of P 2. Both m 1 and m 2 must be smaller than n, so by induction P 1 and P 2 can be triangulated so P can be triangulated as well. Now we have to prove any triangulation of P contains n-2 triangles. Consider an arbitrary diagonal in some triangulation T p. This diagonal cuts P into 2 subpolygons with m 1 and m 2 vertices. Every vertex of P occurs in exactly one of 2 subpolygons. Hence m 1 +m 2 = n+2. So by induction any triangulation of P i contains m i -2 triangles  (m 1 -2) + (m 2 -2) = n-2 triangles.

Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 7 Number of triangles in any triangulation of a simple polygon with n vertices. Case 1: n=3 Case 2: n>3

Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 8 Case 2: uw not completely in P Proof of the existence of diagonals in P Consider leftmost vertex v of P Case 1: uw completely in P u v w u v w

Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 9 Proof of the existence of a diagonal in P

Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 10

Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 11 Upper and lower bounds for the number of guards Idea: Compute a 3-coloring of the vertices and place guards on a color. Result:  n/3  guards are sufficient. We know that for any simple polygon with n vertices (n-2)guards are always enough. But can we do better?

Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 12 Example

Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 13 Theorem Theorem: Each simple polygon is 3-colorable. Proof:Dual graph is a binary tree, this means that we can find a 3-coloring using a simple DFS. Corollary:  n/3  guards are always sufficient to guard a simple Polygon with n vertices.

Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 14 Art gallery theorem Theorem: For a simple polygon with n vertices,  n/3  cameras are occasionally necessary and always sufficient to have every point in the polygon visible from at least one of the cameras. Proof:Worst-case example.