Separators for sphere-packings and nearest neighbor graphs

Journal of the ACM

Volumn 44, Issue 1, 1997, Pages 1-29

  Miller, Gary L ^a,e   Teng, Shang Hua ^b,f   Thurston, William ^c   Vavasis, Stephen A ^d,g  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF MINNESOTA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d Department of Obstetrics Gynecology   (United States)

^e Carnegie Mellon University   (United States)

^f University of Minnesota   (United States)

^g Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GEOMETRY; GRAPH THEORY; MAGNETIC DISK STORAGE; THEOREM PROVING;

NEAREST NEIGHBOR GRAPHS; SEPARATOR ALGORITHM; SPHERE PACKINGS;

ALGORITHMS;

EID: 0030703027     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/256292.256294     Document Type: Article

References (53)

1. ALON N., SEYMOUR, P., AND THOMAS, R. 1990. A separator theorem for graphs with an excluded minor and its applications. In Proceedings of the 22th Annual ACM Symposium on Theory of Computing (Baltimore, Md., May 14-16). ACM, New York pp. 293-299.
2. ANDREEV, E. M. 1970a. On convex polyhedra in Lobacevskii space. Math. USSR Sbornik 10, 3, 413-440.
3. ANDREEV, E. M. 1970b. On convex polyhedra of finite volume in Lobacevskii space. Math. USSR Sbornik, 12, 2, 270-259.
4. BENTLEY, J. L. 1980. Multidimensional divide-and-conquer. Commun. ACM 23, 4 (Apr.), 214-229.
5. CLARKSON, K. 1983. Fast algorithm for the all-nearest-neighbors problem. In Proceedings of the 24th Annual Symposium on Foundations of Computer Science. IEEE, New York, pp. 226-232.
6. CLARKSON, K., EPPSTEIN, D., MILLER, G., STURTIVANT, C., AND TENG, S.-H. 1993. Approximating center points with iterated radon points. In Proceedings of 9th Annual ACM Symposium on Computational Geometry (San Diego, Calif., May 19-21). ACM, New York, pp. 91-98.
7. CONWAY, J. H., AND SLOANE, N. J. A. 1988. Sphere Packings, Lattices and Groups. Springer-Verlag, New York.
8. CORMEN, T. H., LEISERSON, C. E., AND RIVEST, R. L. 1990. Introduction to Algorithms. MIT Press, Cambridge, Mass.
9. DANZER, L., FONLUPT, J., AND KLEE, V. 1963. Helly's theorem and its relatives. In Proceedings of Symposia in Pure Mathematics, vol. 7. American Mathematical Society, 7:101-180.
10. DE FRAYSSEIX, H., PACH, J., AND POLLACK, R. 1988. Small sets supporting Fáry embeddings of planar graphs. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (Chicago, Ill., May 2-4). ACM, New York, pp. 426-433.
11. EDELSBRUNNER, H. 1987. Algorithms in Combinatorial Geometry. Springer-Verlag, New York.
12. EPPSTEIN, D., AND ERICKSON, J. 1994. Iterated nearest neighbors and finding minimal polytopes. Disc. Comput. Geometry, 11, (3), 321-350.
13. EPPSTEIN, D., MILLER, G. L., AND TENG, S.-H. 1993. A deterministic linear time algorithm for geometric separators and its applications. In Proceedings of 9th Annual ACM Symposium on Computational Geometry (San Diego, Calif., May 19-21). ACM, New York, pp. 99-108.
14. FÁRY, I. 1948. On straight line representing of planar graphs. Acta. Sci. Math. 24, 229-233.
15. FRIEZE, A., MILLER, G., AND TENG, S.-H. 1992. Separator-based parallel divide and conquer in computational geometry. In Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures (San Diego, Calif., June 29-July 1). ACM, New York, pp. 422-430.
16. GILBERT, J. R., MILLER, G. L., AND TENG, S.-H. 1997. Geometric mesh partitioning: Implementation and experiments. SIAM J. Sci. Comput., to appear.
17. GILBERT, J. R., HUTCHINSON, J. P., AND TARJAN, R. E. 1984. A separation theorem for graphs of bounded genus. J. Algorithms 5, 391-407.
18. GRÖTSCHEL, M., LOVÁSZ, L., AND SCHRIJVER, A. 1988. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, New York.
19. GUIBAS, L., PACH, J., AND SHARIR, M. 1994. Sphere-of-influence graphs in higher dimensions. In Intuitive Geometry, K. Boroczky and G. Fejes Toth, eds. Colloquia Mathematica Societatis J. Bolyai, vol. 63. North-Holland, Amsterdam, The Netherlands, pp. 131-137.
20. HAUSSLER, D., AND WELZL, E. 1987. ε-net and simplex range queries. Disc. Comput. Geometry 2, 127-151.
21. JORDAN, C. 1869. Sur les assemblages de lignes. J. Reine Angew. Math. 70, 185-190.
22. KABATIANSKY, G. A., AND LEVENSHTEIN, V. I. 1978. Bounds for packings on a sphere and in space. Prob. Per. Info. 14, 1, 3-25.
23. KOEBE, P. 1936. Kontaktprobleme der konformen Abbildung. Ber. Verh. Sächs. Akademie der Wissenschaften Leipzig, Math.-Phys. Klasse 88, 141-164.
24. LEIGHTON, F. T. 1983. Complexity Issues in VLSI. Foundations of Computing. MIT Press, Cambridge, Mass.
25. LEISERSON, C. E. 1983. Area-Efficient VLSI Computation. Foundations of Computing. MIT Press, Cambridge, Mass.
26. LINIAL, N., LONDON, E., AND RABINOVICH, Y. 1995. The geometry of graphs and some of its algorithmic applications. Combinatorica 15, 2, 215-245.
27. LIPTON, R. J., AND TARJAN, R. E. 1979. A separator theorem for planar graphs. SIAM J. Appl. Math. 36, (Apr.), 177-189.
28. LIPTON, R. J., ROSE, D. J., AND TARJAN, R. E. 1979. Generalized nested dissection. SIAM J. Numer. Anal. 16, 346-358.
29. MILLER, G. L., TENG, S.-H., AND VAVASIS, S. A. 1991. An unified geometric approach to graph separators. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science. IEEE, New York, pp. 538-547.
30. MILLER, G. L., TENG, S.-H., THURSTON, W., AND VAVASIS, S. A. 1993. Automatic mesh partitioning. In Sparse Matrix Computations: Graph Theory Issues and Algorithms, A. George, J. Gilbert, and J. Liu, eds. IMA Volumes in Mathematics and Its Applications. Springer-Verlag, New York.
31. MILLER, G. L., TENG, S.-H., THURSTON, W., AND VAVASIS, S. A. 1997. Geometric separators for finite element meshes. SIAM J. Sci. Comput., to appear.
32. MILLER, G. L., AND THURSTON, W. 1990. Separators in two and three dimensions. In Proceedings of the 22th Annual ACM Symposium on Theory of Computing, (Baltimore, Md., May 14-16). ACM, New York, pp. 300-309.
33. MILLER, G. L., AND VAVASIS, S. A. 1991. Density graphs and separators. In Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, Calif., Jan. 28-30). ACM, New York, pp. 331-336.
34. MOHAR, B. 1993. A polynomial time circle packing algorithm. Disc. Comput. Geom. 241-250.
35. PACH, J., AND AGARWAL, P. 1995. Combinatorial Geometry. Wiley-Interscience, New York.
36. PLOTKIN, S., RAO, S., AND SMITH, W. D. 1994. Shallow excluded minors and improved graph decomposition. In Proceedings at the 5th Symposium Discrete Algorithms. SIAM, New York, pp. 462-470.
37. PREPARATA, F. P., AND SHAMOS, M. I. 1985. Computational Geometry: An Introduction. Texts and Monographs in Computer Science. Springer-Verlag, New York.
38. SOMMERVILLE, D. M. Y. 1958. An Introduction to the Geometry of n Dimensions. Dover, New York.
39. SPIELMAN, D. A., AND TENG, S.-H. 1996a. Disk packings and planar separators. In Proceedings of 12th Annual ACM Symposium on Computational Geometry (Philadelphia, Pa., May 24-26). ACM, New York, pp. 349-359.
40. SPIELMAN, D. A., AND TENG, S.-H. 1996b. Spectral partitioning works: planar graphs and finite element meshes. UCB//CSD-96-898, U.C. Berkeley, Berkeley, California.
41. TENG, S.-H. 1991. Points, Spheres, and Separators: A unified geometric approach to graph partitioning. Ph.D. dissertation. CMU-CS-91-184. School of Computer Science, Carnegie-Mellon Univ., Pittsburgh, Pa.
42. TENG, S.-H. 1994. Combinatorial aspects of geometric graphs. MIT Tech. Rep. TR-612. May. In Lecture Notes in Computer Science. Springer-Verlag, New York.
43. THOMASSEN, C. 1980. Planarity and duality of finite and infinite graphs. J. Combin. Theory, Series B 29, 244-271.
44. TOUSSAINT, G. 1988. A graph-theoretical primal sketch. In Computational Morphology, G. Toussaint, ed., Elsevier-North Holland, Amsterdam, The Netherlands, pp. 229-260.
45. THURSTON, W. P. 1988. The geometry and topology of 3-manifolds. Princeton University Notes, Princeton, N.J.
46. TUTTE, W. T. 1960. Convex representations of graphs. Proc. London Math. Soc. 10, 3, 304-320.
47. TUTTE, W. T. 1963. How to draw a graph. Proc. London Math. Soc. 13, 3, 743-768.
48. UNGAR, P. 1951. A theorem on planar graphs. J. London Math Soc. 26, 256-262.
49. VALIANT, L. G. 1981. Universality consideration in VLSI circuits. IEEE Trans. Comput. 30, 2 (Feb.). 135-140.
50. VAPNIK V, N. AND CHERVONENKIS, A. YA. 1971. On the uniform convergence of relative frequencies of events to their probabilities. Theory Prob. Appl. 16, 264-280.
51. VAVASIS, S. A. 1991. Automatic domain partitioning in three dimensions. SIAM J. Sci. Stat. Comput. 12, 950-970.
52. WYNER, A. D. 1965. Capabilities of bounded discrepancy decoding. Bell System Tech. J. 44, 1061-1122.
53. ZIEGLER, G. M. 1988. Lectures on polytopes. In Graduate Texts in Mathematics, vol. 152. Springer-Verlag, New York.