Scribd Logo
Upload

Welcome to Scribd!

  • CSN-523: Computational Geometry: Indian Institute of Technology Roorkee

    Uploaded by

    saiavinash duddupudi
    13 views12 pages
    The document discusses the art gallery problem in computational geometry. It summarizes that triangulations can always be 3-colored, which allows placing guards at nodes of the least frequent color to guard the entire space. The art gallery theorem states that floor(n/3) cameras are always sufficient and sometimes necessary to monitor n vertices in a simple polygon. Fisk's proof of this theorem is also overviewed.

    Original Description:

    Original Title

    CSN523_Lec_6.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses the art gallery problem in computational geometry. It summarizes that triangulations can always be 3-colored, which allows placing guards at nodes of the least frequent color to guard the entire space. The art gallery theorem states that floor(n/3) cameras are always sufficient and sometimes necessary to monitor n vertices in a simple polygon. Fisk's proof of this theorem is also overviewed.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    13 views12 pages

    CSN-523: Computational Geometry: Indian Institute of Technology Roorkee

    Uploaded by

    saiavinash duddupudi
    The document discusses the art gallery problem in computational geometry. It summarizes that triangulations can always be 3-colored, which allows placing guards at nodes of the least frequent color to guard the entire space. The art gallery theorem states that floor(n/3) cameras are always sufficient and sometimes necessary to monitor n vertices in a simple polygon. Fisk's proof of this theorem is also overviewed.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 12

    INDIAN INSTITUTE OF TECHNOLOGY ROORKEE

    CSN-523: Computational Geometry

    Lecture 6: Art Gallery Problem

    Dr. Sudip Roy


    Assistant Professor
    Department of Computer Science & Engineering
    Piazza Class Room: https://piazza.com/iitr.ac.in/spring2017/csn523/home
    Moodle Site: http://moodle.iitr.ac.in/course/view.php?id=23 [Enrollment Key: csn523@2017]
    Triangulation and Diagonals:

    2
    Dual graph of a triangulation:

    3
    3-Coloring Always Exists:

    4
    3-Coloring Always Exists:

    5
    Art-Gallery Problem:

    red green

    Place guards at the nodes assigned with the Algorithm of Avis and Toussaint, 1981
    least-frequently used color.

    6
    Art-Gallery Problem:

    Algorithm of Avis and Toussaint, 1981

    7
    Art-Gallery Problem:

    8
    Floor(n/3) cameras are enough:

    vertices.

    9
    Art-Gallery Theorem:

    10
    Fisks Proof:

    11
    Fisks Proof:

    12

    You might also like