Well Separated Pair Decomposition
Publisher
Springer New York
Reference15 articles.
1. Agarwal P, Guibas L, Ngyuen A, Russel D, Zhang L (2004) Collision detection for deforming necklaces. Comput Geom Theory Appl 28(2):137–163
2. Aingworth D, Chekuri C, Indyk P, Motwani R (1999) Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J Comput 28(4):1167–1181
3. Arikati SR, Chen DZ, Chew LP, Das G, Smid MHM, Zaroliagis CD (1996) Planar spanners and approximate shortest path queries among obstacles in the plane. In: Díaz J, Serna M (eds) Proceedings of the 4th annual European symposium on algorithms, Barcelona, pp 514–528
4. 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:67–90
5. Clark BN, Colbourn CJ, Johnson DS (1990) Unit disk graphs. Discret Math 86:165–177