Communication-efficient construction of the plane localized Delaunay graph
Let V be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane 4π√3/9-spanner of the unit-disk graph . Each node can only communicate with nodes that are within unit-distance from it. This algorithm only makes one round of communication and each point of V broadcasts at most 5 messages. This improves on all previously known message-bounds for this problem.