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

  • Mohammad Farshi
  • Joachim Gudmundsson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4525)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Mohammad Farshi
    • 1
  • Joachim Gudmundsson
    • 2
  1. 1.Department of Mathematics and Computing Science, TU Eindhoven, P.O. Box 513, 5600 MB EindhovenThe Netherlands
  2. 2.NICTA, SydneyAustralia

Personalised recommendations