Advertisement

Algorithmica

, Volume 42, Issue 3–4, pp 249–264 | Cite as

Constructing Plane Spanners of Bounded Degree and Low Weight

  • Prosenjit BoseEmail author
  • Joachim GudmundssonEmail author
  • Michiel SmidEmail author
Article

Abstract

Given a set S of n points in the plane, we give an O(n log n)-time algorithm that constructs a plane t-spanner for S, with t ≈ 10, such that the degree of each point of S is bounded from above by 27, and the total edge length is proportional to the weight of a minimum spanning tree of S. Previously, no algorithms were known for constructing plane t-spanners of bounded degree.

Computational geometry Spanners Planar graphs Bounded degree graphs Low weight graphs 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2005

Authors and Affiliations

  1. 1.School of Computer Science, Carleton University, Ottawa, Ontario, K1S 5B6Canada
  2. 2.Department of Mathematics and Computing Science, TU Eindhoven, P.O. Box 513, 5600 MB EindhovenThe Netherlands

Personalised recommendations