Separators for sphere-packings and nearest neighbor graphs
暂无分享,去创建一个
Gary L. Miller | Shang-Hua Teng | Stephen A. Vavasis | William P. Thurston | S. Vavasis | S. Teng | G. Miller | W. Thurston
[1] Robin Thomas,et al. A separator theorem for graphs with an excluded minor and its applications , 1990, STOC '90.
[2] C. Jordan. Sur les assemblages de lignes. , 1869 .
[3] Leslie G. Valiant,et al. Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.
[4] David Eppstein,et al. A deterministic linear time algorithm for geometric separators and its applications , 1993, SCG '93.
[5] Alan M. Frieze,et al. Separator based parallel divide and conquer in computational geometry , 1992, SPAA '92.
[6] W. Fischer,et al. Sphere Packings, Lattices and Groups , 1990 .
[7] M. Sharir,et al. Sphere-of-influence graphs in higher dimensions , 1994 .
[8] Bojan Mohar,et al. A polynomial time circle packing algorithm , 1993, Discret. Math..
[9] Shang-Hua Teng,et al. Combinatorial aspects of geometric graphs , 1998, Comput. Geom..
[10] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[11] Kenneth L. Clarkson,et al. Fast algorithms for the all nearest neighbors problem , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[12] F. Thomas Leighton,et al. Complexity Issues in VLSI , 1983 .
[13] David Eppstein,et al. Iterated nearest neighbors and finding minimal polytopes , 1993, SODA '93.
[14] Stephen A. Vavasis,et al. Automatic Domain Partitioning in Three Dimensions , 1991, SIAM J. Sci. Comput..
[15] Carsten Thomassen,et al. Planarity and duality of finite and infinite graphs , 1980, J. Comb. Theory, Ser. B.
[16] Gary L. Miller,et al. A unified geometric approach to graph separators , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[17] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[18] W. T. Tutte. How to Draw a Graph , 1963 .
[19] John R Gilbert,et al. A Separator Theorem for Graphs of Bounded Genus , 1984, J. Algorithms.
[20] W. T. Tutte. A THEOREM ON PLANAR GRAPHS , 1956 .
[21] David Eppstein,et al. Approximating center points with iterated radon points , 1993, SCG '93.
[22] D. M. Y. Sommerville,et al. An Introduction to The Geometry of N Dimensions , 2022 .
[23] Gary L. Miller,et al. Automatic Mesh Partitioning , 1992 .
[24] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[25] W. Thurston. The geometry and topology of 3-manifolds , 1979 .
[26] János Pach,et al. Combinatorial Geometry , 2012 .
[27] Shang-Hua Teng,et al. Spectral partitioning works: planar graphs and finite element meshes , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[28] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .
[29] Shang-Hua Teng,et al. Disk packings and planar separators , 1996, SCG '96.
[30] David Haussler,et al. ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..
[31] J. Pach,et al. Combinatorial geometry , 1995, Wiley-Interscience series in discrete mathematics and optimization.
[32] Gary L. Miller,et al. Density graphs and separators , 1991, SODA '91.
[33] Gary L. Miller,et al. Separators in two and three dimensions , 1990, STOC '90.
[34] D. Rose,et al. Generalized nested dissection , 1977 .
[35] János Pach,et al. Small sets supporting fary embeddings of planar graphs , 1988, STOC '88.
[36] G. Ziegler. Lectures on Polytopes , 1994 .
[37] V. Klee,et al. Helly's theorem and its relatives , 1963 .
[38] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[39] W. T. Tutte. Convex Representations of Graphs , 1960 .
[40] P. Ungar. A Theorem on Planar Graphs , 1951 .
[41] S. Vavasis,et al. Geometric Separators for Finite-Element Meshes , 1998, SIAM J. Sci. Comput..
[42] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[43] E. M. Andreev. ON CONVEX POLYHEDRA OF FINITE VOLUME IN LOBAČEVSKIĬ SPACE , 1970 .
[44] H. Piaggio. An Introduction to the Geometry of N Dimensions , 1930, Nature.
[45] A. Wyner. Capabilities of bounded discrepancy decoding , 1965 .
[46] Charles E. Leiserson,et al. Area-Efficient VLSI Computation , 1983 .
[47] R. Tarjan,et al. A Separator Theorem for Planar Graphs , 1977 .
[48] N. J. A. Sloane,et al. Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.
[49] Gary L. Miller,et al. Geometric Mesh Partitioning: Implementation and Experiments , 1998, SIAM J. Sci. Comput..
[50] E. M. Andreev. ON CONVEX POLYHEDRA IN LOBAČEVSKIĬ SPACES , 1970 .
[51] Satish Rao,et al. Shallow excluded minors and improved graph decompositions , 1994, SODA '94.
[52] G. Toussaint. A Graph-Theoretical Primal Sketch , 1988 .
[53] Jon Louis Bentley,et al. Multidimensional divide-and-conquer , 1980, CACM.
[54] Gary L. Miller,et al. Geometric mesh partitioning: implementation and experiments , 1995, Proceedings of 9th International Parallel Processing Symposium.
[55] S. Teng. Points, spheres, and separators: a unified geometric approach to graph partitioning , 1992 .