Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published 2005 | public
Journal Article Open

Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications

Abstract

We extend the classic notion of well-separated pair decomposition [P. B. Callahan and S. R. Kosaraju, J. ACM, 42 (1975), pp. 67--90] to the unit-disk graph metric: the shortest path distance metric induced by the intersection graph of unit disks. We show that for the unit-disk graph metric of n points in the plane and for any constant $c\geq 1$, there exists a c-well-separated pair decomposition with O(n log n) pairs, and the decomposition can be computed in O(n log n) time. We also show that for the unit-ball graph metric in k dimensions where $k\geq 3$, there exists a c-well-separated pair decomposition with O(n2-2/k) pairs, and the bound is tight in the worst case. We present the application of the well-separated pair decomposition in obtaining efficient algorithms for approximating the diameter, closest pair, nearest neighbor, center, median, and stretch factor, all under the unit-disk graph metric.

Additional Information

© 2005 Society for Industrial and Applied Mathematics. Reprinted with permission. Received by the editors October 16, 2003; accepted for publication (in revised form) February 2, 2005; published electronically October 3, 2005.

Files

GAOsiamjc05.pdf
Files (239.7 kB)
Name Size Download all
md5:e5a900feabc1e5d72fa4fd9a2185f305
239.7 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 13, 2023