The Quest for Optimal Solutions for the Art Gallery Problem: a Practical Iterative Algorithm?

Total Page:16

File Type:pdf, Size:1020Kb

The Quest for Optimal Solutions for the Art Gallery Problem: a Practical Iterative Algorithm? The Quest for Optimal Solutions for the Art Gallery Problem: a Practical Iterative Algorithm? Davi C. Tozoni, Pedro J. de Rezende, and Cid C. de Souza Institute of Computing, University of Campinas Campinas, Brazil [email protected], frezende j [email protected] www.ic.unicamp.br Abstract. The general Art Gallery Problem (AGP) consists in finding the minimum number of guards sufficient to ensure the visibility coverage of an art gallery represented by a polygon. The AGP is a well known NP-hard problem and, for this reason, all algorithms proposed so far to solve it are unable to guarantee optimality except in especial cases. In this paper, we present a new method for solving the Art Gallery Problem by iteratively generating upper and lower bounds while seeking to reach an exact solution. Notwithstanding that convergence remains an important open question, our algorithm has been successfully tested on a very large collection of instances from publicly available benchmarks. Tests were carried out for several classes of instances totalizing more than a thousand hole-free polygons with sizes ranging from 20 to 1000 vertices. The proposed algorithm showed a remarkable performance, obtaining provably optimal solutions for every instance in a matter of minutes on a standard desktop computer. To our knowledge, despite the AGP having been studied for four decades within the field of computational geometry, this is the first time that an exact algorithm is proposed and extensively tested for this problem. Future research directions to expand the present work are also discussed. 1 Introduction The Art Gallery Problem (AGP) is one of the most investigated problems in computational geometry. The problem’s input consists of a simple polygon, representing the outline of an art gallery, and one seeks to find a smallest set of points where guards should be placed so that the entire gallery is visually covered. Guards are assumed to have 360 degrees of unlimited vision, distance wise, and a polygon is said to be (visually) covered when every point of it is visible by at least one guard. We say that a point is visible by another whenever the line segment connecting them does not intersect the exterior of the polygon. Figure 1 illustrates a simplified floor plan of the Musée du Louvre and an optimal solution consisting of ten guards. Fig. 1. Louvre polygon representation (left); an optimal guard positioning (right). ? This research was supported by FAPESP – Fundação de Amparo à Pesquisa do Estado de São Paulo, CNPq – Conselho Nacional de Desenvolvimento Científico e Tecnológico and FAEPEX/Unicamp. 2 Tozoni, D. C., de Rezende, P. J., de Souza, C. C. In the version of the AGP considered in this work, often referred to as the AGP with point guards, there are no contraints on the positions of the guards. Moreover, we assume that the polygon is hole-free, meaning that its complement is connected. Many variations of this problem have been studied in the literature, including generalizations in which one allows for the presence of holes in the interior of the polygon or restrictions where guard placement is limited a priori to some finite set of points (e.g., the set of vertices), see [17,19]. Both of these cases are known to be NP-hard [17,16]. To this date, as no exact algorithm exists except for the latter case [7], a great deal of effort has been placed on the development of heuristics and approximation techniques [1,3,12]. Our Contribution. In this paper, we present a practical iterative algorithm for the Art Gallery Problem with point guards, which finds a sequence of decreasing upper bounds and increasing lower bounds for the optimal value. As evidence of the effectiveness of the proposed algorithm, we also present results showing that for every one of more than 1440 benchmark polygons of various classes gathered from the literature with up to a thousand vertices, optimal solutions are attained in just a few minutes of computing time. This work is unprecedented since, despite several decades of extensive investigation on the AGP, all previously published algorithms were unable to handle instances of that size and often failed to prove optimality for a significant fraction of the instances tested. As a matter of fact, as recently as last year, experts have claimed that “practical algorithms to find optimal solutions or almost-optimal bounds are not known” for this problem [14]. Organization of the text. In the next section, a few basic definitions and notations are presented. Section 3 is devoted to a short survey of the relevant related works. Section 4 describes the main steps of the proposed algorithm. The most relevant implementation details are given in Section 5, while Section 6 discusses the computational results obtained from the experiments. Finally, in Section 7, we draw some conclusions and identify future directions in this research. 2 Preliminaries We briefly review, in this section, concepts that are relevant for understanding the remaining of the paper. Recall that, in the Art Gallery Problem, the gallery is represented by a simple polygon P , which, in this work, is assumed to contain no holes. We say that two points in P are visible from each other if the line segment that joins them does not intersect the exterior of the polygon. The visibility polygon of a point p 2 P , denoted by Vis(p), is the set of all points in P that are visible from p. The edges of Vis(p) are called visibility edges and they are said to be proper for p if and only they are not contained in any edges of P . Given a finite set S of points in P , a maximal connected region in [p2SVis(p) (P n [p2SVis(p)) is called a covered (uncovered) region induced by S in P . Moreover, the geometric arrangement defined by the visibility edges of the points in S partitions P into a collection of convex polygonal faces called Atomic Visibility Polygons or simply AVPs. Clearly, the edges of an AVP are either portions of edges of P or portions of proper visibility edges for points of S. AVPs can be classified according to their visibility properties relative to the points of S. We say that an AVP F is a light (shadow) AVP if there exists a subset T of S such that F is (is not) visible from any point in T and the only proper visibility edges that spawn F emanate from points in T (see Figure 2). We now describe discretized versions of the AGP that are fundamental to our approach. Recollect that in the most general version of the problem, the set of points to be covered and the set of potential guards are both infinite (equal to P ). In contrast, the discretizations we consider here aim at reducing the set of points to be covered and/or the set of guard candidates to be finite. Firstly, in the Art Gallery Problem With Fixed Guard Candidates (AGPFC), one is given a finite set of points C ⊂ P , and the question consists of selecting the minimum number of guards in C that are sufficient to cover the entire polygon. A special case of the AGPFC is obtained when the elements of C are restricted to the vertices of P , in which case we call it the Art Gallery Problem With Vertex Guards (AGPVG). In another discrete version, named Art Gallery Problem With Witnesses (AGPW), one is given a finite set of points W ⊂ P , and the problem consists in finding the minimum number of guards in P that are sufficient to cover all points in W . Clearly, coverage of W does not ensure that of P . In [6] the authors define a polygon P to be witnessable if there exists a finite witness set W ⊂ P satisfying the property A Practical Iterative Algorithm for the Art Gallery Problem 3 Fig. 2. Basic definitions: Visibility polygon of a point (left); a finite subset of points S (center) and the arrangement induced by S with the light (gray) and shadow (dark gray) AVPs (right). that any set of guards that covers W also covers the entire polygon P . Later, in the implementation of our algorithm, we will explore a fundamental result on witnessable polygons. Finally, a third discretization is introduced when both the witness set and the guard candidate set are required to be finite. This discretization leads to a hybrid of the last two problems which we will denote by AGPWFC. It is worth noting that the latter problem can easily be cast as a Set Cover Problem (SCP) in which the elements of W have to be covered using the subsets comprised of the witness points that are covered by the candidate guards. Despite being NP-hard, large instances of the SCP can be solved quite efficiently using modern integer programming solvers. Our algorithm takes advantage of this fact. Although we tackle the discrete versions of AGP described above, the reader should bear in mind that, under the assumption of convergence, the algorithm presented in Section 4 leads to an optimal solution to the original problem. Later, we shall further elucidate this point. As we close this section, let us evoke that, to avoid ambiguities, unless stated otherwise, the term Art Gallery Problem and its acronym AGP are employed throughout this text to refer to the formulation with point guards. 3 Related Work The Art Gallery Problem was initially proposed by Klee in 1973 as the question of determining the minimum number of guards sufficient to watch over an entire art gallery, represented by a simple polygon of n edges [13].
Recommended publications
  • Stony Brook University
    SSStttooonnnyyy BBBrrrooooookkk UUUnnniiivvveeerrrsssiiitttyyy The official electronic file of this thesis or dissertation is maintained by the University Libraries on behalf of The Graduate School at Stony Brook University. ©©© AAAllllll RRRiiiggghhhtttsss RRReeessseeerrrvvveeeddd bbbyyy AAAuuuttthhhooorrr... Combinatorics and Complexity in Geometric Visibility Problems A Dissertation Presented by Justin G. Iwerks to The Graduate School in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy in Applied Mathematics and Statistics (Operations Research) Stony Brook University August 2012 Stony Brook University The Graduate School Justin G. Iwerks We, the dissertation committee for the above candidate for the Doctor of Philosophy degree, hereby recommend acceptance of this dissertation. Joseph S. B. Mitchell - Dissertation Advisor Professor, Department of Applied Mathematics and Statistics Esther M. Arkin - Chairperson of Defense Professor, Department of Applied Mathematics and Statistics Steven Skiena Distinguished Teaching Professor, Department of Computer Science Jie Gao - Outside Member Associate Professor, Department of Computer Science Charles Taber Interim Dean of the Graduate School ii Abstract of the Dissertation Combinatorics and Complexity in Geometric Visibility Problems by Justin G. Iwerks Doctor of Philosophy in Applied Mathematics and Statistics (Operations Research) Stony Brook University 2012 Geometric visibility is fundamental to computational geometry and its ap- plications in areas such as robotics, sensor networks, CAD, and motion plan- ning. We explore combinatorial and computational complexity problems aris- ing in a collection of settings that depend on various notions of visibility. We first consider a generalized version of the classical art gallery problem in which the input specifies the number of reflex vertices r and convex vertices c of the simple polygon (n = r + c).
    [Show full text]
  • A Visibility-Based Approach to Computing Non-Deterministic
    Article The International Journal of Robotics Research 1–16 A visibility-based approach to computing Ó The Author(s) 2021 Article reuse guidelines: non-deterministic bouncing strategies sagepub.com/journals-permissions DOI: 10.1177/0278364921992788 journals.sagepub.com/home/ijr Alexandra Q Nilles1 , Yingying Ren1, Israel Becerra2,3 and Steven M LaValle1,4 Abstract Inspired by motion patterns of some commercially available mobile robots, we investigate the power of robots that move forward in straight lines until colliding with an environment boundary, at which point they can rotate in place and move forward again; we visualize this as the robot ‘‘bouncing’’ off boundaries. We define bounce rules governing how the robot should reorient after reaching a boundary, such as reorienting relative to its heading prior to collision, or relative to the normal of the boundary. We then generate plans as sequences of rules, using the bounce visibility graph generated from a polygonal environment definition, while assuming we have unavoidable non-determinism in our actuation. Our planner can be queried to determine the feasibility of tasks such as reaching goal sets and patrolling (repeatedly visiting a sequence of goals). If the task is found feasible, the planner provides a sequence of non-deterministic interaction rules, which also provide information on how precisely the robot must execute the plan to succeed. We also show how to com- pute stable cyclic trajectories and use these to limit uncertainty in the robot’s position. Keywords Underactuated robots, dynamics, motion control, motion planning 1. Introduction approach is powerful and well-suited to dynamic environ- ments, but also resource-intensive in terms of energy, Mobile robots have rolled smoothly into our everyday computation, and storage space.
    [Show full text]
  • Exploring Topics of the Art Gallery Problem
    The College of Wooster Open Works Senior Independent Study Theses 2019 Exploring Topics of the Art Gallery Problem Megan Vuich The College of Wooster, [email protected] Follow this and additional works at: https://openworks.wooster.edu/independentstudy Recommended Citation Vuich, Megan, "Exploring Topics of the Art Gallery Problem" (2019). Senior Independent Study Theses. Paper 8534. This Senior Independent Study Thesis Exemplar is brought to you by Open Works, a service of The College of Wooster Libraries. It has been accepted for inclusion in Senior Independent Study Theses by an authorized administrator of Open Works. For more information, please contact [email protected]. © Copyright 2019 Megan Vuich Exploring Topics of the Art Gallery Problem Independent Study Thesis Presented in Partial Fulfillment of the Requirements for the Degree Bachelor of Arts in the Department of Mathematics and Computer Science at The College of Wooster by Megan Vuich The College of Wooster 2019 Advised by: Dr. Robert Kelvey Abstract Created in the 1970’s, the Art Gallery Problem seeks to answer the question of how many security guards are necessary to fully survey the floor plan of any building. These floor plans are modeled by polygons, with guards represented by points inside these shapes. Shortly after the creation of the problem, it was theorized that for guards whose positions were limited to the polygon’s j n k vertices, 3 guards are sufficient to watch any type of polygon, where n is the number of the polygon’s vertices. Two proofs accompanied this theorem, drawing from concepts of computational geometry and graph theory.
    [Show full text]
  • On Visibility Problems in the Plane – Solving Minimum Vertex Guard Problems by Successive Approximations ?
    On Visibility Problems in the Plane – Solving Minimum Vertex Guard Problems by Successive Approximations ? Ana Paula Tomas´ 1, Antonio´ Leslie Bajuelos2 and Fabio´ Marques3 1 DCC-FC & LIACC, University of Porto, Portugal [email protected] 2 Dept. of Mathematics & CEOC - Center for Research in Optimization and Control, University of Aveiro, Portugal [email protected] 3 School of Technology and Management, University of Aveiro, Portugal [email protected] Abstract. We address the problem of stationing guards in vertices of a simple polygon in such a way that the whole polygon is guarded and the number of guards is minimum. It is known that this is an NP-hard Art Gallery Problem with relevant practical applications. In this paper we present an approximation method that solves the problem by successive approximations, which we intro- duced in [21]. We report on some results of its experimental evaluation and des- cribe two algorithms for characterizing visibility from a point, that we designed for its implementation. 1 Introduction The classical Art Gallery problem for a polygon P is to find a minimum set of points G in P such that every point of P is visible from some point of G. We address MINIMUM VERTEX GUARD in which the set of guards G is a subset of the vertices of P and each guard has 2π range unlimited visibility. This is an NP-hard combinatorial problem both for arbitrary and orthogonal polygons [13, 17]. Orthogonal (i.e. rectilinear) polygons are interesting for they may be seen as abstractions of art galleries, for instance.
    [Show full text]
  • Efficient Computation of Visibility Polygons
    EuroCG 2014, Ein-Gedi, Israel, March 3{5, 2014 Efficient Computation of Visibility Polygons Francisc Bungiu∗ Michael Hemmery John Hershbergerz Kan Huangx Alexander Kr¨ollery Abstract a subroutine in algorithms for other problems, most prominently in the context of the Art Gallery Prob- Determining visibility in planar polygons and ar- lem [16]. In experimental work on this problem [15] rangements is an important subroutine for many al- we have identified visibility computations as having a gorithms in computational geometry. In this paper, substantial impact on overall computation times, even we report on new implementations, and correspond- though it is a low-order polynomial-time subroutine in ing experimental evaluations, for two established and an algorithm solving an NP-hard problem. Therefore one novel algorithm for computing visibility polygons. it is of enormous interest to have efficient implemen- These algorithms will be released to the public shortly, tations of visibility polygon algorithms available. as a new package for the Computational Geometry CGAL, the Computational Geometry Algorithms Algorithms Library (CGAL). Library [5], contains a large number of algorithms and data structures, but unfortunately not for the 1 Introduction computation of visibility polygons. We present im- plementations for three algorithms, which form the Visibility is a basic concept in computational geome- basis for an upcoming new CGAL package for visi- try. For a polygon P R2, we say that a point p P bility. Two of these are efficient implementations for ⊂ 2 is visible from q P if the line segment pq P . The standard O(n)- and O(n log n)-time algorithms from 2 ⊆ points that are visible from q form the visibility re- the literature.
    [Show full text]
  • Parallel Geometric Algorithms. Fenglien Lee Louisiana State University and Agricultural & Mechanical College
    Louisiana State University LSU Digital Commons LSU Historical Dissertations and Theses Graduate School 1992 Parallel Geometric Algorithms. Fenglien Lee Louisiana State University and Agricultural & Mechanical College Follow this and additional works at: https://digitalcommons.lsu.edu/gradschool_disstheses Recommended Citation Lee, Fenglien, "Parallel Geometric Algorithms." (1992). LSU Historical Dissertations and Theses. 5391. https://digitalcommons.lsu.edu/gradschool_disstheses/5391 This Dissertation is brought to you for free and open access by the Graduate School at LSU Digital Commons. It has been accepted for inclusion in LSU Historical Dissertations and Theses by an authorized administrator of LSU Digital Commons. For more information, please contact [email protected]. INFORMATION TO USERS This manuscript has been reproduced from the microfilm master. UMI films the text directly from the original or copy submitted. Thus, some thesis and dissertation copies are in typewriter face, while others may be from any type of computer printer. The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleedthrough, substandard margins, and improper alignment can adversely affect reproduction. In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion. Oversize materials (e.g., maps, drawings, charts) are reproduced by sectioning the original, beginning at the upper left-hand corner and continuing from left to right in equal sections with small overlaps. Each original is also photographed in one exposure and is included in reduced form at the back of the book.
    [Show full text]
  • A Time-Space Trade-Off for Computing the K-Visibility Region of a Point In
    A Time-Space Trade-off for Computing the k-Visibility Region of a Point in a Polygon∗ Yeganeh Bahooy Bahareh Banyassadyz Prosenjit K. Bosex Stephane Durochery Wolfgang Mulzerz Abstract Let P be a simple polygon with n vertices, and let q 2 P be a point in P . Let k 2 f0; : : : ; n − 1g. A point p 2 P is k-visible from q if and only if the line segment pq crosses the boundary of P at most k times. The k-visibility region of q in P is the set of all points that are k-visible from q. We study the problem of computing the k-visibility region in the limited workspace model, where the input resides in a random-access read-only memory of O(n) words, each with Ω(log n) bits. The algorithm can read and write O(s) additional words of workspace, where s 2 N is a parameter of the model. The output is written to a write-only stream. Given a simple polygon P with n vertices and a point q 2 P , we present an algorithm that reports the k-visibility region of q in P in O(cn=s + c log s + minfdk=sen; n log logs ng) expected time using O(s) words of workspace. Here, c 2 f1; : : : ; ng is the number of critical vertices of P for q where the k-visibility region of q may change. We generalize this result for polygons with holes and for sets of non-crossing line segments. Keywords: Limited workspace model, k-visibility region, Time-space trade-off 1 Introduction Memory constraints on mobile devices and distributed sensors have led to an increasing focus on algorithms that use their memory efficiently.
    [Show full text]
  • Optimizing Terrestrial Laser Scanning Measurement Set-Up
    OPTIMIZING TERRESTRIAL LASER SCANNING MEASUREMENT SET-UP Sylvie Soudarissanane and Roderik Lindenbergh Remote Sensing Department (RS)) Delft University of Technology Kluyverweg 1, 2629 HS Delft, The Netherlands (S.S.Soudarissanane, R.C.Lindenbergh)@tudelft.nl http://www.lr.tudelft.nl/rs Commission WG V/3 KEY WORDS: Laser scanning, point cloud, error, noise level, accuracy, optimal stand-point ABSTRACT: One of the main applications of the terrestrial laser scanner is the visualization, modeling and monitoring of man-made structures like buildings. Especially surveying applications require on one hand a quickly obtainable, high resolution point cloud but also need observations with a known and well described quality. To obtain a 3D point cloud, the scene is scanned from different positions around the considered object. The scanning geometry plays an important role in the quality of the resulting point cloud. The ideal set-up for scanning a surface of an object is to position the laser scanner in such a way that the laser beam is near perpendicular to the surface. Due to scanning conditions, such an ideal set-up is in practice not possible. The different incidence angles and ranges of the laser beam on the surface result in 3D points of varying quality. The stand-point of the scanner that gives the best accuracy is generally not known. Using an optimal stand-point of the laser scanner on a scene will improve the quality of individual point measurements and results in a more uniform registered point cloud. The design of an optimum measurement setup is defined such that the optimum stand-points are identified to fulfill predefined quality requirements and to ensure a complete spatial coverage.
    [Show full text]
  • An Introductory Study on Art Gallery Theorems and Problems
    AN INTRODUCTORY STUDY ON ART GALLERY THEOREMS AND PROBLEMS JEFFRY CHHIBBER M Dept of Mathematics, Noorul Islam Centre of Higher Education, Kanyakumari, Tamil Nadu, India. E-mail: [email protected] Abstract - In computational geometry and robot motion planning, a visibility graph is a graph of intervisible locations, typically for a set of points and obstacles in the Euclidean plane. Visibility graphs may also be used to calculate the placement of radio antennas, or as a tool used within architecture and urban planningthrough visibility graph analysis. This is a brief survey on the visibility graphs application in Art Gallery Problems and Theorems. Keywords- Art galley theorems, orthogonal polygon, triangulation, Visibility graphs I. INTRODUCTION point y outside of P if the segment xy is nowhere interior to P; xy may intersect ∂P, the boundary of P. In a visibility graph, each node in the graph Star polygon: A polygon visible from a single interior represents a point location, and each edge represents point. Diagonal: A segment inside a polygon whose a visible connectionbetween them. That is, if the line endpoints are vertices, and which otherwise does not segment connecting two locations does not pass touch ∂P. Floodlight: A light that illuminates from the through any obstacle, an edge is drawn between them apex of a cone with aperture α. Vertex floodlight: in the graph. Lozano-Perez & Wesley (1979) attribute One whose apex is at a vertex (at most one per the visibility graph method for Euclidean shortest vertex). paths to research in 1969 by Nils Nilsson on motion planning for Shakey the robot, and also cite a 1973 The problem: description of this method by Russian mathematicians What is the art gallery problem? M.
    [Show full text]
  • Visibility Polygon Traversal Algorithm
    Visibility polygon traversal algorithm Izaki, Åsmund 1 Derix, Christian 1 Keywords: visibility in polygon with holes; query-based algorithm; spatial analysis Abstract The determination of visibility relations within polygonal environments has applications in many different fields; In the current context it is primarily investigated as a basis for spatial architectural analysis, and as a design driver for architectural design from a user and occupant perspective, but it is equally applicable to a wide range of engineering problems and it’s a well- established topic in computational geometry. We introduce a new query-based algorithm for traversing over the visible convex regions of a polygon with holes from any point inside the polygon or from any of its vertices, where each query runs in O(f’ h’ + log n) for a polygon with n vertices, f’ visible convex partitions, and h’ visible holes, with a preprocessing stage that runs in O(n log* n) with O(n) space. The log n component of the query only applies to internal points. The visibility polygon traversal algorithm is applicable to a varied set of visibility problems, including the construction of visibility polygons (isovists), and visibility graphs of polygon vertices and/or points inside the polygon. The algorithmic findings are linked to spatial architectural analysis by representing the regions of architectural or urban plans that are permeable or visually open as polygons with holes. Two applications of the algorithm are presented, which have enabled more responsive and dynamic user interactions with architectural plans. These consist of an interactive isovist tool and a tool for calculating shortest paths, flows and distances within a multi-storey layout.
    [Show full text]
  • 30 POLYGONS Joseph O’Rourke, Subhash Suri, and Csaba D
    30 POLYGONS Joseph O'Rourke, Subhash Suri, and Csaba D. T´oth INTRODUCTION Polygons are one of the fundamental building blocks in geometric modeling, and they are used to represent a wide variety of shapes and figures in computer graph- ics, vision, pattern recognition, robotics, and other computational fields. By a polygon we mean a region of the plane enclosed by a simple cycle of straight line segments; a simple cycle means that nonadjacent segments do not intersect and two adjacent segments intersect only at their common endpoint. This chapter de- scribes a collection of results on polygons with both combinatorial and algorithmic flavors. After classifying polygons in the opening section, Section 30.2 looks at sim- ple polygonizations, Section 30.3 covers polygon decomposition, and Section 30.4 polygon intersection. Sections 30.5 addresses polygon containment problems and Section 30.6 touches upon a few miscellaneous problems and results. 30.1 POLYGON CLASSIFICATION Polygons can be classified in several different ways depending on their domain of application. In chip-masking applications, for instance, the most commonly used polygons have their sides parallel to the coordinate axes. GLOSSARY Simple polygon: A closed region of the plane enclosed by a simple cycle of straight line segments. Convex polygon: The line segment joining any two points of the polygon lies within the polygon. Monotone polygon: Any line orthogonal to the direction of monotonicity inter- sects the polygon in a single connected piece. Star-shaped polygon: The entire polygon is visible from some point inside the polygon. Orthogonal polygon: A polygon with sides parallel to the (orthogonal) coordi- nate axes.
    [Show full text]
  • Guarding and Searching Polyhedra
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Electronic Thesis and Dissertation Archive - Università di Pisa Universita` di Pisa Dipartimento di Informatica Dottorato di Ricerca in Informatica Ph.D. Thesis: XXIV Guarding and Searching Polyhedra Giovanni Viglietta Supervisor Referee Prof. Linda Pagli Prof. Peter Widmayer Referee Prof. Masafumi Yamashita Chair Prof. Fabrizio Broglia November 11, 2012 Abstract Guarding and searching problems have been of fundamental interest since the early years of Computational Geometry. Both are well-developed areas of research and have been thoroughly studied in planar polygonal settings. In this thesis we tackle the Art Gallery Problem and the Searchlight Scheduling Problem in 3-dimensional polyhedral environments, putting special emphasis on edge guards and orthogonal polyhedra. We solve the Art Gallery Problem with reflex edge guards in orthogonal polyhedra having reflex edges in just two directions: generalizing a classic theorem by O'Rourke, we prove that br=2c + 1 reflex edge guards are sufficient and occasionally necessary, where r is the number of reflex edges. We also show how to compute guard locations in O(n log n) time. Then we investigate the Art Gallery Problem with mutually parallel edge guards in orthogonal polyhedra with e edges, showing that b11e=72c edge guards are always sufficient and can be found in linear time, improving upon the previous state of the art, which was be=6c. We also give tight inequalities relating e with the number of reflex edges r, obtaining an upper bound on the guard number of b7r=12c + 1.
    [Show full text]