We present a near-quadratic time algorithm that computes a point inside a simple polygon P
in the plane having approximately the largest visibility polygon inside P, and a near-linear …

This paper introduces a new wireless sensor network planning problem referred to as the
Optimal Sensor Configuration (OSC) problem. In this problem, the goal is to find an optimal …

Given a geometric domain $ P $, visibility-based search problems seek routes for one or
more mobile agents (``watchmen'') to move within $ P $ in order to be able to see a portion …

In the Art Gallery problem, given is a polygonal gallery and the goal is to guard the gallery's
interior or walls with a number of guards that must be placed strategically in the interior, on …

We consider the problem of finding a small hitting set in an {\it infinite} range space
$\cF=(Q,\cR) $ of bounded VC-dimension. We show that, under reasonably general …

Dentro de la Geometría Computacional, uno de los campos que ha suscitado mayor interés
entre la comunidad científica internacional ha sido el de la Visibilidad, es decir, el conjunto …

We consider the problem of sweeping (or grazing) the interior/exterior of a polygon by a
exible rope whose one end point (anchor) is attached on the boundary of the polygon. We …

RESUMO Este trab< IIho an< IIis< I< IIgum< Is im< Igens construídas por Jules Michelet em
Le Peuple, n< J primeir< J met< Jde do século XIX, no conte>." éo< l'l" historiogr< Jh'l …

We consider the problem of finding efficient locations of surveillance cameras, where we
distinguish between two different problems. In the first, the whole area must be monitored …

Οι ταχύτατα αναπτυσσόμενες τεχνολογίες τηλεπικοινωνιών δημιουργούν συνεχώς νέα πεδία
έρευνας με πρακτικό αλλά και θεωρητικό ενδιαφέρον. Η αξιοπιστία και η ανεξαρτησία των …