Given an n-vertex 1.5D terrain and a set of m<n viewpoints, the
Vorono...
Let R be a set of n colored imprecise points, where each point is
colore...
Given is a 1.5D terrain 𝒯, i.e., an x-monotone polygonal chain
in ℝ^2. F...
The k-center problem is to choose a subset of size k from a set of n
poi...
Let P be a set of n points in ℝ^2. For a given positive
integer w<n, our...
A polygonal curve P with n vertices is c-packed, if the sum of the
lengt...
We consider the problem of testing, for a given set of planar regions
R...
Assume we are given a set of parallel line segments in the plane, and we...
In this paper we study the following problem: we are given a set of impr...
In this note we show by example that the algorithm presented in 1979 by
...
We revisit the following problem: Given a convex polygon P, find the
lar...