Encyclopedia of Algorithms

2016 Edition
| Editors: Ming-Yang Kao

Well Separated Pair Decomposition for Unit-Disk Graph

  • Jie GaoEmail author
  • Li Zhang
Reference work entry
DOI: https://doi.org/10.1007/978-1-4939-2864-4_480

Years and Authors of Summarized Original Work

  • 2003; Gao, Zhang


Unit Disk Graphs Well Separated Pair Decomposition 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Callahan P (1995) Dealing with higher dimensions: the well-separated pair decomposition and its applications. Ph.D. thesis, The Johns Hopkins UniversityGoogle Scholar
  2. 2.
    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–90MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Eppstein D (1999) Spanning trees and spanners. In: Sack JR, Urrutia J (eds) Handbook of computational geometry. Elsevier, Amsterdam, pp 425–461Google Scholar
  4. 4.
    Ghao J, Zhang L (2005) Well-separated pair decomposition for the unit disk graph metric and its applications. SIAM J Comput 35(1):151–169MathSciNetCrossRefGoogle Scholar
  5. 5.
    Narasimhan G, Smid M (2007) Geometric spanner networks. Cambridge University Press, New YorkCrossRefzbMATHGoogle Scholar
  6. 6.
    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–290Google Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Department of Computer ScienceStony Brook UniversityStony BrookUSA
  2. 2.Microsoft ResearchMountain ViewUSA