Skip to main content
Article thumbnail
Location of Repository

Communication-efficient construction of the plane localized delaunay graph

By Prosenjit Bose, Paz Carmi, Michiel Smid and Daming Xu

Abstract

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újo and Rodrigues (Fas

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.311.5169
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://arxiv.org/pdf/0809.2956... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.