Communication-efficient construction of the plane localized Delaunay graph

Prosenjit Bose; Paz Carmi; Michiel Smid; Daming Xu

doi:10.1007/978-3-642-12200-2_26

Communication-efficient construction of the plane localized Delaunay graph

Prosenjit Bose
, Paz Carmi
, Michiel Smid
, Daming Xu

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	LATIN 2010
Subtitle of host publication	Theoretical Informatics - 9th Latin American Symposium, Proceedings
Pages	282-293
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-12200-2_26
State	Published - 18 Jun 2010
Event	9th Latin American Theoretical Informatics Symposium, LATIN 2010 - Oaxaca, Mexico Duration: 19 Apr 2010 → 23 Apr 2010

Publication series

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

Conference

Conference	9th Latin American Theoretical Informatics Symposium, LATIN 2010
Country/Territory	Mexico
City	Oaxaca
Period	19/04/10 → 23/04/10

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-12200-2_26

Cite this

Bose, P., Carmi, P., Smid, M., & Xu, D. (2010). Communication-efficient construction of the plane localized Delaunay graph. In LATIN 2010: Theoretical Informatics - 9th Latin American Symposium, Proceedings (pp. 282-293). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6034 LNCS). https://doi.org/10.1007/978-3-642-12200-2_26

@inproceedings{95e35702b47541fd943d9a97362158b3,

title = "Communication-efficient construction of the plane localized Delaunay graph",

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

author = "Prosenjit Bose and Paz Carmi and Michiel Smid and Daming Xu",

year = "2010",

month = jun,

day = "18",

doi = "10.1007/978-3-642-12200-2\_26",

language = "English",

isbn = "3642121993",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "282--293",

booktitle = "LATIN 2010",

note = "9th Latin American Theoretical Informatics Symposium, LATIN 2010 ; Conference date: 19-04-2010 Through 23-04-2010",

}

Bose, P, Carmi, P, Smid, M & Xu, D 2010, Communication-efficient construction of the plane localized Delaunay graph. in LATIN 2010: Theoretical Informatics - 9th Latin American Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6034 LNCS, pp. 282-293, 9th Latin American Theoretical Informatics Symposium, LATIN 2010, Oaxaca, Mexico, 19/04/10. https://doi.org/10.1007/978-3-642-12200-2_26

Communication-efficient construction of the plane localized Delaunay graph. / Bose, Prosenjit; Carmi, Paz; Smid, Michiel et al.
LATIN 2010: Theoretical Informatics - 9th Latin American Symposium, Proceedings. 2010. p. 282-293 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6034 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Communication-efficient construction of the plane localized Delaunay graph

AU - Bose, Prosenjit

AU - Carmi, Paz

AU - Smid, Michiel

AU - Xu, Daming

PY - 2010/6/18

Y1 - 2010/6/18

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

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

UR - https://www.scopus.com/pages/publications/77953507651

U2 - 10.1007/978-3-642-12200-2_26

DO - 10.1007/978-3-642-12200-2_26

M3 - Conference contribution

AN - SCOPUS:77953507651

SN - 3642121993

SN - 9783642121999

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 282

EP - 293

BT - LATIN 2010

T2 - 9th Latin American Theoretical Informatics Symposium, LATIN 2010

Y2 - 19 April 2010 through 23 April 2010

ER -

Bose P, Carmi P, Smid M, Xu D. Communication-efficient construction of the plane localized Delaunay graph. In LATIN 2010: Theoretical Informatics - 9th Latin American Symposium, Proceedings. 2010. p. 282-293. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-12200-2_26

Communication-efficient construction of the plane localized Delaunay graph

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this