The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique
We study the problem of computing the Voronoi diagram of a set of.n2 points with.O(log n)-bit coordinates in the Euclidean plane in a substantiallysublinear in . n number of rounds in the congested clique model with . n nodes.Recently, Jansson et al. have shown that if the points are uniformly at random distributed in a unit square then their Voronoi diagram within the square can be computed in.O(
