On bounded degree plane strong geometric spanners

Prosenjit Bose; Paz Carmi; Lilach Chaitman-Yerushalmi

doi:10.1016/j.jda.2012.03.004

On bounded degree plane strong geometric spanners

Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi

Department of Computer Science

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

Abstract

Given a set P of n points in the plane, we show how to compute in O(nlogn) time a spanning subgraph of their Delaunay triangulation that has maximum degree 7 and is a strong plane t-spanner of P with t=(1+√2) ² * δ, where δ is the spanning ratio of the Delaunay triangulation. Furthermore, the maximum degree bound can be reduced slightly to 6 while remaining a strong plane constant spanner at the cost of an increase in the spanning ratio and no longer being a subgraph of the Delaunay triangulation.

Original language	American English
Pages (from-to)	16-31
Number of pages	16
Journal	Journal of Discrete Algorithms
Volume	15
DOIs	https://doi.org/10.1016/j.jda.2012.03.004
State	Published - 1 Aug 2012

Keywords

Computational geometry
Geometric spanners

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/j.jda.2012.03.004

Cite this

@article{98fcecc2158343de9e79f7d02fe2ebc0,

title = "On bounded degree plane strong geometric spanners",

abstract = "Given a set P of n points in the plane, we show how to compute in O(nlogn) time a spanning subgraph of their Delaunay triangulation that has maximum degree 7 and is a strong plane t-spanner of P with t=(1+√2) 2 * δ, where δ is the spanning ratio of the Delaunay triangulation. Furthermore, the maximum degree bound can be reduced slightly to 6 while remaining a strong plane constant spanner at the cost of an increase in the spanning ratio and no longer being a subgraph of the Delaunay triangulation.",

keywords = "Computational geometry, Geometric spanners",

author = "Prosenjit Bose and Paz Carmi and Lilach Chaitman-Yerushalmi",

year = "2012",

month = aug,

day = "1",

doi = "10.1016/j.jda.2012.03.004",

language = "American English",

volume = "15",

pages = "16--31",

journal = "Journal of Discrete Algorithms",

issn = "1570-8667",

publisher = "Elsevier",

}

TY - JOUR

T1 - On bounded degree plane strong geometric spanners

AU - Bose, Prosenjit

AU - Carmi, Paz

AU - Chaitman-Yerushalmi, Lilach

PY - 2012/8/1

Y1 - 2012/8/1

N2 - Given a set P of n points in the plane, we show how to compute in O(nlogn) time a spanning subgraph of their Delaunay triangulation that has maximum degree 7 and is a strong plane t-spanner of P with t=(1+√2) 2 * δ, where δ is the spanning ratio of the Delaunay triangulation. Furthermore, the maximum degree bound can be reduced slightly to 6 while remaining a strong plane constant spanner at the cost of an increase in the spanning ratio and no longer being a subgraph of the Delaunay triangulation.

AB - Given a set P of n points in the plane, we show how to compute in O(nlogn) time a spanning subgraph of their Delaunay triangulation that has maximum degree 7 and is a strong plane t-spanner of P with t=(1+√2) 2 * δ, where δ is the spanning ratio of the Delaunay triangulation. Furthermore, the maximum degree bound can be reduced slightly to 6 while remaining a strong plane constant spanner at the cost of an increase in the spanning ratio and no longer being a subgraph of the Delaunay triangulation.

KW - Computational geometry

KW - Geometric spanners

UR - http://www.scopus.com/inward/record.url?scp=84861625536&partnerID=8YFLogxK

U2 - 10.1016/j.jda.2012.03.004

DO - 10.1016/j.jda.2012.03.004

M3 - Article

SN - 1570-8667

VL - 15

SP - 16

EP - 31

JO - Journal of Discrete Algorithms

JF - Journal of Discrete Algorithms

ER -

On bounded degree plane strong geometric spanners

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this