A note on minimal art galleries

09/19/2019
by   Eryk Lipka, et al.
0

We will consider some extensions of the polygonal art gallery problem. In a recent paper Morrison has shown the smallest (9 sides) example of an art gallery that cannot be observed by guards placed in every third corner. Author also mentioned two related problems, for which the minimal examples are not known. We will show that a polygonal fortress such that its exterior cannot be guarded by sentries placed in every second vertex has at least 12 sides. Also, we will show an example of three-dimensional polyhedron such that its inside cannot be covered by placing guard in every vertex which has both fewer vertices and faces than previously known.

READ FULL TEXT

page 5

page 6

research
03/17/2020

The Parameterized Complexity of Guarding Almost Convex Polygons

Art Gallery is a fundamental visibility problem in Computational Geometr...
research
02/16/2021

(-k)-critical trees and k-minimal trees

In a graph G=(V,E), a module is a vertex subset M of V such that every v...
research
10/18/2022

The smallest 5-chromatic tournament

A coloring of a digraph is a partition of its vertex set such that each ...
research
04/30/2018

A Linear-Time Approximation Algorithm for the Orthogonal Terrain Guarding Problem

In this paper, we consider the 1.5-dimensional orthogonal terrain guardi...
research
08/01/2022

Reduction Rules and ILP Are All You Need: Minimal Directed Feedback Vertex Set

This note describes the development of an exact solver for Minimal Direc...
research
06/08/2019

On the Leaders' Graphical Characterization for Controllability of Path Related Graphs

The problem of leaders location plays an important role in the controlla...
research
05/17/2021

A Simple Search Problem

A simple problem is studied in which there are N boxes and a prize known...

Please sign up or login with your details

Forgot password? Click here to reset