In this paper we discuss the kinetic maintenance of the Euclidean Voronoi diagram and its dual, the Delaunay triangulation, for a set of moving disks. The most important aspect in ...
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
Given a set S of n point sites in the plane, the City Voronoi diagram partitions the plane into the Voronoi regions of the sites, with respect to the City metric. This metric is i...
We consider Voronoi-like partitions for a team of moving targets distributed in the plane, such that each set in this partition is uniquely associated with a particular moving targ...