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
Name | Size | Download all |
---|---|---|
md5:e5a900feabc1e5d72fa4fd9a2185f305
|
239.7 kB | Preview Download |
Additional details
- Eprint ID
- 1370
- Resolver ID
- CaltechAUTHORS:GAOsiamjc05
- Created
-
2006-01-12Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field