Approximation algorithms for shortest path motion planning
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Approximating the complete Euclidean graph
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
On sparse spanners of weighted graphs
Discrete & Computational Geometry
Euclidean spanners: short, thin, and lanky
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Approximating geometrical graphs via “spanners” and “banyans”
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Dynamic algorithms for geometric spanners of small diameter: randomized solutions
Computational Geometry: Theory and Applications
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
SIAM Journal on Computing
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
Geometric Spanner Networks
Randomized and deterministic algorithms for geometric spanners of small diameter
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Experimental study of geometric t-spanners
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Computing the Greedy Spanner in Near-Quadratic Time
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Feed-links for network extensions
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Narrow-Shallow-Low-Light Trees with and without Steiner Points
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
The construction of t-spanners of a given point set has received a lot of attention, especially from a theoretical perspective. We experimentally study the performance of the most common construction algorithms for points in the Euclidean plane. In a previous paper 10 we considered the properties of the produced graphs from five common algorithms. We consider several additional algorithms and focus on the running times. This is the first time an extensive comparison has been made between the running times of construction algorithms of t-spanners.