A human observer can effortlessly identify visible portions of geometric objects present in the
environment. However, computations of visible portions of objects from a viewpoint involving …

Unsolved problems in visibility graphs of points, segments, and polygons Page 1 22 Unsolved
Problems in Visibility Graphs of Points, Segments, and Polygons SUBIR K. GHOSH, Tata …

The maximum clique problem is a problem that takes many forms in optimization and related
graph theory problems, and also has many applications. Because of its NP-completeness …

Over the past two decades the main focus of research into first-order (FO) model checking
algorithms has been on sparse relational structures–culminating in the FPT algorithm by …

A subset S of non-negative integers N o is called a numerical semigroup if it is a submonoid
of N o and has a finite complement in N o. An undirected graph G (S) associated with S is a …

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 …

We study the problem of colouring visibility graphs of polygons. In particular, for visibility
graphs of simple polygons, we provide a polynomial algorithm for 4-colouring, and prove …

Curve pseudo-visibility graphs generalize polygon and pseudo-polygon visibility graphs and
form a hereditary class of graphs. We prove that every curve pseudo-visibility graph with …

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 …