TY - GEN
T1 - An optimal algorithm for computing angle-constrained spanners
AU - Carmi, Paz
AU - Smid, Michiel
N1 - Funding Information:
★ This work was supported by the Natural Sciences and Engineering Research Council of Canada.
PY - 2010/12/1
Y1 - 2010/12/1
N2 - 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 θ.
AB - 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 θ.
UR - https://www.scopus.com/pages/publications/78650855798
U2 - 10.1007/978-3-642-17517-6_29
DO - 10.1007/978-3-642-17517-6_29
M3 - Conference contribution
AN - SCOPUS:78650855798
SN - 3642175163
SN - 9783642175169
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 316
EP - 327
BT - Algorithms and Computation - 21st International Symposium, ISAAC 2010, Proceedings
T2 - 21st Annual International Symposium on Algorithms and Computations, ISAAC 2010
Y2 - 15 December 2010 through 17 December 2010
ER -