Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique.
We consider geometric problems on planar n2-point sets in the congested clique model. Initially, each node in the n-clique network holds a batch of n distinct points in the Euclidean plane given by Ο(log n)-bit coordinates. Ineach round, each node can send a distinct Ο(log n)-bit message to each other node in the clique and perform unlimited local computations. We show that the convex hull of the
