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
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Approximate distance oracles for geometric graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
SIAM Journal on Computing
Fast Approximation Schemes for Euclidean Multi-connectivity Problems
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
t-Spanners as a Data Structure for Metric Space Searching
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Spanners and message distribution in networks
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
Computing a minimum-dilation spanning tree is NP-hard
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Sparse geometric graphs with small dilation
Computational Geometry: Theory and Applications
Computing a minimum-dilation spanning tree is NP-hard
Computational Geometry: Theory and Applications
Computing the Greedy Spanner in Near-Quadratic Time
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
A peer-to-peer architecture for multi-path data transfer optimization using local decisions
Proceedings of the Third Workshop on Dependable Distributed Data Management
Experimental study of geometric t-spanners: a running time comparison
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
| 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. In this paper we perform the first extensive experimental study of the properties of t-spanners. The main aim is to examine the quality of the produced spanners in the plane. We implemented the most common t-spanner algorithms and tested them on a number of different point sets. The experiments are discussed and compared to the theoretical results and in several cases we suggest modifications that are implemented and evaluated. The quality measurements that we consider are the number of edges, the weight, the maximum degree, the diameter and the number of crossings.