Communication-efficient construction of the plane localized Delaunay graph

Prosenjit Bose, Paz Carmi, Michiel Smid, Daming Xu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

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 . 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.

Original languageEnglish
Title of host publicationLATIN 2010
Subtitle of host publicationTheoretical Informatics - 9th Latin American Symposium, Proceedings
Pages282-293
Number of pages12
DOIs
StatePublished - 18 Jun 2010
Event9th Latin American Theoretical Informatics Symposium, LATIN 2010 - Oaxaca, Mexico
Duration: 19 Apr 201023 Apr 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6034 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th Latin American Theoretical Informatics Symposium, LATIN 2010
Country/TerritoryMexico
CityOaxaca
Period19/04/1023/04/10

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Communication-efficient construction of the plane localized Delaunay graph'. Together they form a unique fingerprint.

Cite this