This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Callahan P (1995) Dealing with higher dimensions: the well-separated pair decomposition and its applications. Ph.D. thesis, The Johns Hopkins University
Callahan PB, Kosaraju SR (1995) A decomposition of multidimensional point sets with applications to k-nearest neighbors and n-body potential fields. J ACM 42(1):67–90
Eppstein D (1999) Spanning trees and spanners. In: Sack JR, Urrutia J (eds) Handbook of computational geometry. Elsevier, Amsterdam, pp 425–461
Ghao J, Zhang L (2005) Well-separated pair decomposition for the unit disk graph metric and its applications. SIAM J Comput 35(1):151–169
Narasimhan G, Smid M (2007) Geometric spanner networks. Cambridge University Press, New York
Talwar K (2004) Bypassing the embedding: approximation schemes and compact representations for low dimensional metrics. In: Proceedings of the thirty-sixth annual ACM symposium on theory of computing (STOC’04), Chicago, pp 281–290
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Gao, J., Zhang, L. (2016). Well Separated Pair Decomposition for Unit-Disk Graph. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_480
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_480
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering