Two points in a polygon are called if the straight line between them lies entirely inside the
polygon. The art gallery problem for a polygon P is to find a minimum set of points G in P …

Abstract In 1973, Victor Klee posed the following question: How many guards are necessary,
and how many are sufficient to patrol the paintings and works of art in an art gallery with n …

We show the following results for polygons without holes: 1. covering the interior or
boundary of an arbitrary polygon with convex polygons is NP-hard, 2. covering the vertices …

Past research on art gallery problems has concentrated almost exclusively on bounds on the
numbers of guards needed in the worst case in various settings. On the complexity side …

Boundary representations (B-reps) and constructive solid geometry (CSG) are widely used
representation schemes for solids. While the problem of computing a B-rep from a CSG …

In this paper, we propose an exact algorithm to solve the orthogonal art gallery problem in
which guards can only be placed on the vertices of the polygon P representing the gallery …

Good methods are known for converting a Constructive Solid Geometry (CSG)
representation of a solid into a boundary representation (b-rep) of the solid, but not for …

Visibility problems appear in a variety of applicative backgrounds. While the traditional" art
gallery" problem, which consists of guarding a given floor plan of an art gallery by a …

This paper presents a bibliography of over 1600 references related to computer vision and
image analysis, arranged by subject matter. The topics covered include architectures; …

In an alternative approach to “characterizing” the graph class of visibility graphs of simple
polygons, we study the problem of finding a maximum clique in the visibility graph of a …