Smoothed Analysis of the Art Gallery Problem

11/03/2018
by   Michael Gene Dobbins, et al.
0

In the Art Gallery Problem we are given a polygon P⊂ [0,L]^2 on n vertices and a number k. We want to find a guard set G of size k, such that each point in P is seen by a guard in G. Formally, a guard g sees a point p ∈ P if the line segment pg is fully contained inside the polygon P. The history and practical findings indicate that irrational coordinates are a "very rare" phenomenon. We give a theoretical explanation. Next to worst case analysis, Smoothed Analysis gained popularity to explain the practical performance of algorithms, even if they perform badly in the worst case. The idea is to study the expected performance on small perturbations of the worst input. The performance is measured in terms of the magnitude δ of the perturbation and the input size. We consider four different models of perturbation. We show that the expected number of bits to describe optimal guard positions per guard is logarithmic in the input and the magnitude of the perturbation. This shows from a theoretical perspective that rational guards with small bit-complexity are typical. Note that describing the guard position is the bottleneck to show NP-membership. The significance of our results is that algebraic methods are not needed to solve the Art Gallery Problem in typical instances. This is the first time an ∃R-complete problem was analyzed by Smoothed Analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/02/2022

Sometimes Two Irrational Guards are Needed

In the art gallery problem, we are given a closed polygon P, with ration...
research
07/26/2020

Beyond the Worst-Case Analysis of Algorithms (Introduction)

One of the primary goals of the mathematical analysis of algorithms is t...
research
09/18/2022

EMaP: Explainable AI with Manifold-based Perturbations

In the last few years, many explanation methods based on the perturbatio...
research
06/20/2017

Unperturbed: spectral analysis beyond Davis-Kahan

Classical matrix perturbation results, such as Weyl's theorem for eigenv...
research
04/14/2023

Optimal Uncoordinated Unique IDs

In the Uncoordinated Unique Identifiers Problem (UUIDP) there are n inde...
research
05/14/2019

Wilkinson's bus: Weak condition numbers, with an application to singular polynomial eigenproblems

We propose a new approach to the theory of conditioning for numerical an...
research
03/09/2020

Smoothed Analysis of Trie Height by Star-like PFAs

Tries are general purpose data structures for information retrieval. The...

Please sign up or login with your details

Forgot password? Click here to reset