A chord is a straight line within a polygon connecting two non-adjacent vertices. Given such
a chord c of a polygon, we denote by n (c) the number of vertices visible from c. The chord …

In memory-constrained algorithms, access to the input is restricted to be read-only, and the
number of extra variables that the algorithm can use is bounded. In this paper we introduce …

Let P be a simple polygon, then the art gallery problem is looking for a minimum set of points
(guards) that can see every point in P. We say two points a, b∊ P can see each other if the …

We present several algorithms for computing the visibility polygon of a simple polygon P of n
vertices (out of which r are reflex) from a viewpoint inside P, when P resides in read-only …

Given a simple polygon $\mathcal {P} $ of $ n $ vertices in the Plane. We study the problem
of computing the visibility area from a given viewpoint $ q $ inside $\mathcal {P} $ where …

Robot perception heavily relies on camera-based visual input for navigating and interacting
in its environment. As robots become integral parts of various applications, the need to …

Let P be a simple polygon with n vertices. We present a new O (n)-time algorithm to compute
the visible part of one edge from another edge of P. The algorithm does not alter the input …

The Art Gallery problem is a famous problem in the field of Computational Geometry. The
variant of the problem discussed in this thesis is defined as follows: given a polygon …