Well-separated pair decomposition for the unit-disk graph metric and its applications

SIAM Journal on Computing

Volumn 35, Issue 1, 2006, Pages 151-169

  Gao, Jie ^a   Zhang, L I ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Approximation algorithm; Unit disk graph; Well separated pair decomposition

Indexed keywords

APPROXIMATION ALGORITHM; UNIT-DISK GRAPH; WELL-SEPARATED PAIR DECOMPOSITION;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS;

GRAPH THEORY;

EID: 33644593717     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703436357     Document Type: Article

References (38)

1. P. K. AGARWAL, H. EDELSBRUNNER, O. SCHWARZKOPF, AND E. WELZL, Euclidean minimum spanning trees and bichromatic closest pairs, Discrete Comput. Geom., 6 (1991), pp. 407-422.
2. D. AINGWORTH, C. CHEKURI, AND R. MOTWANI, Fast estimation of diameter and shortest paths (without matrix multiplication), in Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1996, pp. 547-553.
3. S. R. ARIKATI, D. Z. CHEN, L. P. CHEW, G. DAS, M. H. M. SMID, AND C. D. ZAROLIAGIS, Planar spanners and approximate shortest path queries among obstacles in the plane, in Proceedings of the 4th Annual European Symposium on Algorithms, J. Díaz and M. Serna, eds., 1996, pp. 514-528.
4. S. ARYA, G. DAS, D. M. MOUNT, J. S. SALOWE, AND M. SMID, Euclidean spanners: Short, thin, and lanky, in Proceedings of the 27th ACM Symposium on Theory of Computing, 1995, pp. 489-498.
5. S. ARYA, D. M. MOUNT, AND M. SMID, Randomized and deterministic algorithms for geometric spanners of small diameter, in Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, 1994, pp. 703-712.
6. H. BREU AND D. G. KIRKPATRICK, Unit disk graph recognition is NP-hard, Computational Geom., 9 (1998), pp. 3-24.
7. CALLAHAN AND KOSARAJU, Faster algorithms for some geometric graph problems in higher dimensions, in Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1993, pp. 291-300.
8. P. B. CALLAHAN, Optimal parallel all-nearest-neighbors using the well-separated pair decomposition, in Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 332-340.
9. P. B. CALLAHAN AND S. R. KOSARAJU, Algorithms for dynamic closest-pair and n-body potential fields, in Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1995, pp. 263-272.
10. P. B. CALLAHAN AND S. R. KOSARAJU, A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields, J. ACM, 42 (1995), pp. 67-90.
11. Y.-J. CHIANG AND R. TAMASSIA, Dynamic algorithms in computational geometry, Proc. IEEE, 80 (1992), pp. 1412-1434.
12. B. N. CLARK, C. J. COLBOURN, AND D. S. JOHNSON, Unit disk graphs, Discrete Math., 86 (1990), pp. 165-177.
13. D. EPPSTEIN, G. L. MILLER, AND S.-H. TENG, A deterministic linear time algorithm for geometric separators and its applications, in Proceedings of the 9th Annual ACM Symposium on Computing in Geometry, 1993, pp. 99-108.
14. J. ERICKSON, Dense point sets have sparse Delaunay triangulations, in Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2002, pp. 125-134.
15. T. ERLEBACH, K. JANSEN, AND E. SEIDEL, Polynomial-time approximation schemes for geometric graphs, in Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 671-679.
16. B. FISCHL, M. SERENO, AND A. DALE, Cortical surface-based analysis II: Inflation, flattening, and a surface-based coordinate system, NeuroImage, 9 (1999), pp. 195-207.
17. J. GAO, L. J. GUIBAS, J. HERSHBERGER, L. ZHANG, AND A. ZHU, Geometric spanners for routing in mobile networks, IEEE J. Selected Areas Commun. Wireless Ad Hoc Networks, 23 (2005), pp. 174-185.
18. S. GOVINDARAJAN, T. LUKOVSZKI, A. MAHESHWARI, AND N. ZEH, I/O efficient well-separated pair decomposition and its applications, in Proceedings of the 8th European Symposium on Algorithms, 2000, pp. 220-231.
19. J. GUDMUNDSSON, C. LEVCOPOULOS, G. NARASIMHAN, AND M. SMID, Approximate distance oracles for geometric graphs, in Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2002, pp. 828-837.
20. L. GUIBAS, A. NGUYEN, D. RUSSEL, AND L. ZHANG, Collision detection for deforming necklaces, in Proceedings of the 18th ACM Symposium on Computational Geometry, 2002, pp. 33-42.
21. W. K. HALE, Frequency assignment: Theory and applications, Proc. IEEE, 68 (1980), pp. 1497-1513.
22. H. B. H. III, M. V. MARATHE, V. RADHAKRISHNAN, S. S. RAVI, D. J. ROSENKRANTZ, AND R. E. STEARNS, NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs, J. Algorithms, 26 (1998), pp. 238-274.
23. D. B. JOHNSON AND D. A. MALTZ, Dynamic source routing in ad hoc wireless networks, in Mobile Computing, T. Imielinski and H. F. Korth, eds., Kluwer Internat. Ser. Engrg. Comput. Sci. 353, Kluwer Academic Publishers, Dordecht, The Netherlands, 1996.
24. P. KLEIN, Preprocessing an undirected planar network to enable fast approximate distance queries, in Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2002, pp. 820-827.
25. C. LEVCOPOULOS, G. NARASIMHAN, AND M. H. M. SMID, Improved algorithms for constructing fault-tolerant spanners, Algorithmica, 32 (2002), pp. 144-156.
26. X.-Y. LI, G. CALINESCU, AND P.-J. WAN, Distributed construction of a planar spanner and routing for ad hoc wireless networks, in IEEE INFOCOM 2002, New York, June 2002.
27. C. A. MEAD AND L. CONWAY, Introduction to VLSI Systems, Addison-Wesley, Reading, MA, 1980.
28. G. L. MILLER, S.-H. TENG, AND S. A. VAVASIS, An unified geometric approach to graph separators, in Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, 1991, pp. 538-547.
29. G. NARASIMHAN AND M. SMID, Approximating the stretch factor of Euclidean graphs, SIAM J. Comput., 30 (2000), pp. 978-989.
30. C. PERKINS AND P. BHAGWAT, Highly dynamic destination-seguenced distance-vector routing (DSDV) for mobile computers, in Proceedings of the ACM SIGCOMM'94 Conference on Communications Architectures, Protocols and Applications, 1994, pp. 234-244.
31. C. E. PERKINS AND E. M. ROYER, Ad hoc on-demand distance vector routing, in Proceedings of the IEEE Workshop on Mobile Computing Systems and Applications, 1999, pp. 90-100.
32. W. D. SMITH AND N. C. WORMALD, Geometric separator theorems and applications, in Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, 1998, pp. 232-243.
33. K. J. SUPOWIT, The relative neighborhood graph with an application to minimum spanning trees, J. ACM, 30 (1983), pp. 428-448.
34. J. TENENBAUM, V. DE SILVA, AND J. LANGFORD, A global geometric framework for nonlinear dimensionality reduction, Science, 290 (2000), p. 22.
35. M. THORUP, Compact oracles for reachability and approximate distances in planar digraphs, in Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, 2001, pp. 242-251.
36. M. THORUP AND U. ZWICK, Approximate distance oracles, in Proceedings of the ACM Symposium on Theory of Computing, 2001, pp. 183-192.
37. G. TOUSSAINT, The relative neighborhood graph of a finite planar set, Pattern Recognition, 12 (1980), pp. 261-268.
38. U. ZWICK, Exact and approximate distances in graphs - a survey, in Proceedings of the 9th Annual European Symposium on Algorithms, 2001, pp. 33-48.