Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
McCreight, E.M.: Priority search trees. SIAM J. Comput. 14, 257–276 (1985)
Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. Commun. ACM 33, 668–676 (1990)
Robins, G., Salowe, J.S.: Low-degree minimum spanning tree. Discret. Comput. Geom. 14, 151–165 (1995)
Zheng, S.Q., Lim, J.S., Iyengar, S.S.: Finding obstacle-avoiding shortest paths using implicit connection graphs. IEEE Trans. Comput. Aided Des. 15, 103–110 (1996)
Zhou, H., Shenoy, N., Nicholls, W.: Efficient minimum spanning tree construction without delaunay triangulation. In: Proc. Asian and South Pacific Design Automation Conference, Yokohama, Japan (2001)
Zhou, H., Shenoy, N., Nicholls, W.: Efficient spanning tree construction without delaunay triangulation. Inf. Proc. Lett. 81, 271–276 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Zhou, H. (2008). Rectilinear Spanning Tree. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_336
Download citation
DOI: https://doi.org/10.1007/978-0-387-30162-4_336
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30770-1
Online ISBN: 978-0-387-30162-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering