Abstract We study the Hausdorff Voronoi diagram of point clusters in the plane, a
generalization ofVoronoi diagrams based on the Hausdorff distance function. We derive a …

We study the Hausdorff Voronoi diagram of a set S of polygonal objects in the plane, a
generalization of Voronoi diagrams based on the maximum distance of a point from a …

Abstract In the Hausdorff Voronoi diagram of a set of point-clusters in the plane, the distance
between a point t and a cluster P is measured as the maximum distance between t and any …

In this paper we study the Voronoi diagram for a set of N line segments and circles in the
Euclidean plane. The diagram is a generalization of the Voronoi diagram for a set of points …

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 …

We present linear-time algorithms to construct tree-like Voronoi diagrams with disconnected
regions after the sequence of their faces along an enclosing boundary (or at infinity) is …

Given a family of k disjoint connected polygonal sites of total complexity n, we consider the
farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a …

Given a family of k disjoint connected polygonal sites in general position and of total
complexity n, we consider the farthest-site Voronoi diagram of these sites, where the …

The problem of construction of planar Voronoi diagrams arises in many areas, one of the
most important of which is in nearest neighbor problems. This includes clustering [141 …

The kth-order Voronoi diagram of a set of points in E2 (called sites) subdivides E2 into
maximal regions such that each point within a given region has the same k nearest sites …