Skip to main content
SpringerLink
Log in

Rectilinear Spanning Tree

  • Living reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 542 Accesses

Years and Authors of Summarized Original Work

  • 2001; Zhou, Shenoy, Nicholls

Problem Definition

Given a set of n points in a plane, a spanning tree is a set of edges that connects all the points and contains no cycles. When each edge is weighted using some distance metric of the incident points, the metric minimum spanning tree is a tree whose sum of edge weights is minimum. If the Euclidean distance (L 2) is used, it is called the Euclidean minimum spanning tree; if the rectilinear distance (L 1) is used, it is called the rectilinear minimum spanning tree.

Since the minimum spanning tree problem on a weighted graph is well studied, the usual approach for metric minimum spanning tree is to first define a weighted graph on the set of points and then to construct a spanning tree on it.

Much like a connection graph is defined for the maze search [4], a spanning graph can be defined for the minimum spanning tree construction.

Definition 1.

Given a set of points Vin a plane, an undirected...

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

Access this chapter

Log in via an institution

Institutional subscriptions

Recommended Reading

  1. McCreight EM (1985) Priority search trees. SIAM J Comput 14:257–276

    Article  MathSciNet  MATH  Google Scholar 

  2. Pugh W (1990) Skip lists: a probabilistic alternative to balanced trees. Commun ACM 33:668–676

    Article  Google Scholar 

  3. Robins G, Salowe JS (1995) Low-degree minimum spanning tree. Discret Comput Geom 14:151–165

    Article  MathSciNet  MATH  Google Scholar 

  4. Zheng SQ, Lim JS, Iyengar SS (1996) Finding obstacle-avoiding shortest paths using implicit connection graphs. IEEE Trans Comput Aided Des 15:103–110

    Article  Google Scholar 

  5. Zhou H, Shenoy N, Nicholls W (2001) Efficient minimum spanning tree construction without delaunay triangulation. In: Proceedings of Asian and South Pacific design automation conference, Yokohama

    Book  Google Scholar 

  6. Zhou H, Shenoy N, Nicholls W (2002) Efficient spanning tree construction without delaunay triangulation. Inf Proc Lett 81:271–276

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science, EECS Department, Northwestern University, Evanston, IL, USA

    Hai Zhou

Authors
  1. Hai Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hai Zhou .

Editor information

Editors and Affiliations

  1. Dept. Electrical Engineering & Computer Science, Northwestern University, Evanston, Illinois, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer Science+Business Media New York

About this entry

Cite this entry

Zhou, H. (2015). Rectilinear Spanning Tree. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27848-8_336-2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27848-8_336-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Online ISBN: 978-3-642-27848-8

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation