Determining visibility in planar polygons and arrangements is an important subroutine for
many algorithms in computational geometry. In this paper, we report on new …

In many applications involving spatial objects, we are only interested in objects that are
directly visible from query points. In this paper, we formulate the visible k nearest neighbor …

The classical Art Gallery Problem asks for the minimum number of guards that achieve
visibility coverage of a given polygon. This problem is known to be NP-hard, even for very …

In this paper, we consider the problem of computing the visibility of a query point inside
polygons with holes. The goal is to perform this computation efficiently per query considering …

In this paper, we consider the problem of computing the region visible to a query point
located in a given polygonal domain. The polygonal domain is specified by a simple …

In this paper, we introduce a generalized version of the Watchman Route Problem (WRP)
where the objective is to plan a continuous closed route in a polygon (possibly with holes) …

Many real-world problems, such as placement of surveillance cameras and pricing of hotel
rooms with a view, require the ability to determine the visibility of a given target object from …

Recent advances in 3D modeling provide us with real 3D datasets to answer queries, such
as “What is the best position for a new billboard?” and “Which hotel room has the best …

Abstract The classical Art Gallery Problem asks for the minimum number of guards that
achieve visibility coverage of a given polygon. This problem is known to be NP-hard, even …

In this paper we consider query versions of visibility testing and visibility counting. Let S be a
set of n disjoint line segments in ℜ2 and let s be an element of S. Visibility testing is to …