# Geometric separator theorems and applications

```@article{Smith1998GeometricST,
title={Geometric separator theorems and applications},
author={Warren D. Smith and Nicholas C. Wormald},
journal={Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)},
year={1998},
pages={232-243}
}```
• Published 8 November 1998
• Mathematics
• Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
We find a large number of "geometric separator theorems" such as: I: Given N disjoint isooriented squares in the plane, there exists a rectangle with /spl les/2N/3 squares inside, /spl les/2N/3 squares outside, and /spl les/(4+0(1))/spl radic/N partly in & out. II: There exists a rectangle that is crossed by the minimal spanning tree of N sites in the plane at /spl les/(4/spl middot/3/sup 1/4/+0(1))/spl radic/N points, having /spl les/2N/3 sites inside and outside. These theorems yield a large…
93 Citations

## Figures from this paper

Theory and Application of Width Bounded Geometric Separator ∗
We introduce the notion of width bounded geometric separator, develop the techniques for its existence as well as algorithm, and apply it to obtain a 2 √ n) time exact algorithm for the disk covering
Theory and Application of Width Bounded Geometric Separator
• B. Fu
• Mathematics, Computer Science
STACS
• 2005
The notion of thewidth bounded geometric separator is introduced and the techniques for the existence of the width bounded separator in any d-dimensional Euclidean space are developed.
A Simple Proof of the Existence of a Planar Separator
A simple proof of the existence of a planar separator is provided by showing that it is an easy consequence of the circle packing theorem and reprove other results on separators.
Balanced line separators of unit disk graphs
• Mathematics, Computer Science
Comput. Geom.
• 2020
Balanced Line Separators of Unit Disk Graphs
• Mathematics, Computer Science
• 2017
A geometric version of the graph separator theorem for the unit disk intersection graph is proved, and it is shown that no line-separator of sublinear size in \$n\$ exists when the authors look at disks of arbitrary radii.
Spanners for Geometric Intersection Graphs
• Mathematics, Computer Science
• 2007
This paper presents the first algorithm for constructing spanners of ball graphs with support for fast distance queries, and shows that the spanner construction has complexity almost equivalent to the construction of a Euclidean minimum spanning tree.
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
• Computer Science, Mathematics
STOC
• 2018
An algorithmic and lower-bound framework that facilitates the construction of subexponential algorithms and matching conditional complexity bounds and allows us to derive matching 2Ω(n1−1/d) lower bounds under the Exponential Time Hypothesis even in the much more restricted class of d-dimensional induced grid graphs.
Geometric Separators and the Parabolic Lift
By computing the centerpoint of the points lifted onto a paraboloid rather than using the stereographic map as in the original method, one can sample the desired sphere directly, without computing the conformal transformation.
Sublinear time width-bounded separators and their application to the protein side-chain packing problem
• Mathematics, Computer Science
J. Comb. Optim.
• 2008
The 3D separator designed here is the first sublinear time algorithm for finding geometric separators and is applied to derive an algorithm for the protein side-chain packing problem, which improves and simplified the previous algorithm of Xu.

## References

SHOWING 1-10 OF 44 REFERENCES
Studies in computational geometry motivated by mesh generation
This thesis extensively generalizes the famous formula of Heron and Alexandria (75 AD), for the area of a triangle, and presents the first linear time congruence algorithm for 3-dimensional polyhedra.
Generalized nested dissection
• Computer Science, Mathematics
• 1977
It is shown that sparse Gaussian elimination is efficient for any class of graphs which have good separator, and conversely that graphs without good separators are not amenable to sparse GaRussian elimination.
Euclidean spanners: short, thin, and lanky
• Computer Science
STOC '95
• 1995
It is shown that it is possible to build spanners in optimal O (n log n) time and O(n) space that achieve optimal or near optimal tradeoffs between all combinations of these *Max-Planck-Institut fiir Informatik, Saarbrucken, Germany.
Improved Approximation Schemes for Geometrical Graphs Via Spanners and Banyans
• Computer Science
STOC 1998
• 1998
The algorithms are based on using low-weight Eu-clidean spanner graphs in conjunction with the hierarchical structure theorems that serve as the basis of Arora's work and it is shown that spanners can in principle be made orders of magnitude shorter and simpler by allowing Steiner points.
Reducing the Steiner Problem in a Normed Space
• Mathematics
SIAM J. Comput.
• 1992
It is proved that there always exists a Steiner minimum tree whose Steiner points are located only at points whose coordinates appear in points of P, which means that the Steiner problem for P in such a space is reduced to a Steiners problem on graphs and is solvable by any existing Steiner graph algorithms.
Loxodromic sequences of tangent spheres
In particular, if ~u/su+ 1 = x = e zt for all/~, then x n+2 1"~ 2 X 2 ( n + 2 ) 1 X n + 2 1 X -1 x 1 ) = n x 2 1 , : + 2 + l n x + l " tanh (n + 2) t = n tanh t. All such sequences of spheres (for
On the Problem of Partitioning Planar Graphs
The results in this paper are closely related to the effective use of the divide-and-conquer strategy for solving problems on planar graphs. It is shown that every planar graph can be partitioned
A Separator Theorem for Planar Graphs
• Mathematics
• 1977
Let G be any n-vertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more
A new way to weigh Malnourished Euclidean graphs
• Mathematics, Computer Science
SODA '95
• 1995
In this paper, we show that any Euclidean graph over a set V of n points in k-dimensional space that satisfies either the leapfrog property or the isolation property has small weight, i.e., has
Disk packings and planar separators
• Mathematics
SCG '96
• 1996
We demonstrate that the geometric separator algorithm of Miller, Teng, Thurston, and Vavasis finds a 3/4-separator of size 1.84+ for every n node planar graph. Our bound is derived from an analysis