ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Effectiveness of Local Search for Art Gallery Problems

Bandyapadhyay, Sayan and Basu Roy, Aniket (2017) Effectiveness of Local Search for Art Gallery Problems. In: 15th International Symposium on Algorithms and Data Structures, WADS 2017, 31 July 2017 - 2 August 2017, St. John’s, NL, Canada, pp. 49-60.

[img] PDF
lec_not_com_sci_10389_49-60_2017.pdf - Published Version
Restricted to Registered users only

Download (275kB) | Request a copy
Official URL: https://doi.org/10.1007/978-3-319-62127-2_5


We study the variant of the art gallery problem where we are given an orthogonal polygon P (possibly with holes) and we want to guard it with the minimum number of sliding cameras. A sliding camera travels back and forth along an orthogonal line segment s in P and a point p in P is said to be visible to the segment s if the perpendicular from p onto s lies in P. Our objective is to compute a set containing the minimum number of sliding cameras (orthogonal segments) such that every point in P is visible to some sliding camera. We study the following two variants of this problem: Minimum Sliding Cameras problem, where the cameras can slide along either horizontal or vertical segments in P, and Minimum Horizontal Sliding Cameras problem, where the cameras are restricted to slide along horizontal segments only. In this work, we design local search PTASes for these two problems improving over the existing constant factor approximation algorithms. We note that in the first problem, the polygons are not allowed to contain holes. In fact, there is a family of polygons with holes for which the performance of our local search algorithm is arbitrarily bad.

Item Type: Conference Paper
Series.: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher: Springer Verlag
Additional Information: The Copyright of this article belongs to the Springer Verlag
Keywords: Approximation algorithms; Data structures; Geometry; Local search (optimization); Art gallery problem; Constant-factor approximation algorithms; Horizontal segments; Line segment; Local search; Local search algorithm; Orthogonal segments; Polygons with holes; Cameras
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 25 May 2022 05:02
Last Modified: 25 May 2022 05:23
URI: https://eprints.iisc.ac.in/id/eprint/72599

Actions (login required)

View Item View Item