Chapter

Experimental Algorithms

Volume 4525 of the series Lecture Notes in Computer Science pp 270-284

Experimental Study of Geometric t-Spanners: A Running Time Comparison

  • Mohammad FarshiAffiliated withDepartment of Mathematics and Computing Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven
  • , Joachim GudmundssonAffiliated withNICTA, Sydney

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.