The farthest-color Voronoi diagram (FCVD) is a farthest-site Voronoi structure defined on a
family PP of m point-clusters in the plane, where the total number of points is n. The FCVD …

Given a set of n non-intersecting line segments L and a set Q of m points in R 2; we present
algorithms of the discrete two-center problem for (i) covering,(ii) stabbing and (iii) hitting the …

Abstract The Hausdorff Voronoi diagram of clusters of points in the plane is a generalization
of Voronoi diagrams based on the Hausdorff distance function. Its combinatorial complexity …

Detecting location-correlated groups in point sets is an important task in a wide variety of
applications areas. In addition to merely detecting such groups, the group's shape carries …

Consider a pair of plane straight-line graphs whose edges are colored red and blue,
respectively, and let n be the total complexity of both graphs. We present a O (nn)-time O (n) …

We study the problem of covering a set of segments on a line with the minimum number of
unit-length intervals, where an interval covers a segment if at least one of the two endpoints …

The farthest-color Voronoi diagram (FCVD) is defined on a set of $ n $ points in the plane,
each of which is labeled with one of $ m $ colors. The colored points can be seen as a family …

Given a set S of n line segments in the plane, we say that a region R⊆ R 2 is a stabber for S
if R contains exactly one endpoint of each segment of S. In this paper we provide optimal or …

We study the problem of ordered stabbing of $ n $ balls (of arbitrary and possibly different
radii, no ball contained in another) in $\mathbb {R}^ d $, $ d\geq 3$, with either a directed …

Let S be a set of n disjoint segments in the plane that correspond to edges of the Delaunay
triangulation of some fixed point set. Our goal is to compute all the combinatorially different …