Skip to main content
SpringerLink
Log in

Constructing Plane Spanners of Bounded Degree and Low Weight

  • Published:
Algorithmica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. School of Computer Science, Carleton University, Ottawa, Ontario, K1S 5B6, Canada

    Prosenjit Bose & Michiel Smid

  2. Department of Mathematics and Computing Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands

    Joachim Gudmundsson

Authors
  1. Prosenjit Bose
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joachim Gudmundsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michiel Smid
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Prosenjit Bose, Joachim Gudmundsson or Michiel Smid.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bose, P., Gudmundsson, J. & Smid, M. Constructing Plane Spanners of Bounded Degree and Low Weight. Algorithmica 42, 249–264 (2005). https://doi.org/10.1007/s00453-005-1168-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-005-1168-8

Search

Navigation