Carleton University
Technical Report TR-08-19
September 17, 2008
Communication-Efficient Construction of the Plane Localized Delaunay Graph
P Bose, P Carmi, M Smid, D Xu
Abstract
Let V be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane 4pi(sqrt3)/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 Araujo and Rodrigues (Fast localized Delaunay triangulation, Lecture Notes in Computer Science, volume 3544,2004).