An optimal algorithm for computing angle-constrained spanners

Paz Carmi, Michiel Smid

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

3 Scopus citations

Abstract

Let S be a set of n points in ℝd. A graph G = (S,E) is called a t-spanner for S, if for any two points p and q in S, the shortest-path distance in G between p and q is at most t|pq|, where |pq| denotes the Euclidean distance between p and q. The graph G is called θ-angle-constrained, if any two distinct edges sharing an endpoint make an angle of at least θ. It is shown that, for any θ with 0 < θ < π/3, a θ-angle-constrained t-spanner can be computed in O(n logn) time, where t depends only on θ.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 21st International Symposium, ISAAC 2010, Proceedings
Pages316-327
Number of pages12
EditionPART 1
DOIs
StatePublished - 1 Dec 2010
Event21st Annual International Symposium on Algorithms and Computations, ISAAC 2010 - Jeju Island, Korea, Republic of
Duration: 15 Dec 201017 Dec 2010

Publication series

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

Conference

Conference21st Annual International Symposium on Algorithms and Computations, ISAAC 2010
Country/TerritoryKorea, Republic of
CityJeju Island
Period15/12/1017/12/10

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'An optimal algorithm for computing angle-constrained spanners'. Together they form a unique fingerprint.

Cite this