How many different classes of partially distinguish-able landmarks are needed to ensure
that a robot can always see a landmark without simultaneously seeing two of the same …

In this paper we review recent results on a new variation of the Art Gallery problem. A
common problem we face nowadays, is that of placing a set of wireless modems in a …

The art gallery problem asks for the smallest number of guards required to see every point of
the interior of a polygon $ P $. We introduce and study a similar problem called the …

The purpose of the current study is to investigate a special case of art gallery problem,
namely a sculpture garden problem. In this problem, for a given polygon P, the ultimate goal …

Art gallery problem has been extensively studied by computational geometry, where major
issue was to find the minimum number of guards and their locations to watch inside an art …

We consider a novel class of art gallery problems inspired by wireless localization. Given a
simple polygon P, place and orient guards each of which broadcasts a unique key within a …

A robot navigates in a polygonal region populated by a set of partially distinguishable
landmarks. The robot's motion primitives consist of actions of the form “drive toward a …

The problem of determining visibility locations (VLs) on/inside a domain bounded by a
planar C 1-continuous curve (without vertices), such that entire domain is covered, is …

In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the
edges of which are arcs of curves, with edge or mobile guards. Our focus is on piecewise …

The core of this thesis is the wireless localization or internet café problem, a relatively new
problem which evolved within the field of art gallery problems: An internet café wants to …