No title
We study the problems of computing the Voronoi diagram and a triangulation of a set of n2 points with O(logn)-bit coordinates in the Euclidean plane in a substantially sublinear in n number of rounds in the congested clique model with n nodes. First, we observe 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
