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 UDG(V ). This algorithm makes only one round of communication and each point of V broadcasts at most 5 messages. This improves the previously best message-bound of 11 by Ara

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu
• Keywords: 2-local Algorithm, CORR 2008, Delaunay Triangulation, Education, Unit-disk Graph