Geometric separator

Separators that are closed shapes

A simple case in which a separator is guaranteed to exist is the following:

Thus, R is a geometric separator that separates the n squares into two subset ("inside R" and "outside R"), with a relatively small "loss" (the squares intersected by R are considered "lost" because they do not belong to any of the two subsets).

Proof

Define a 2-fat rectangle as an axis-parallel rectangle with an aspect ratio of at most 2.

Let R₀ be a minimal-area 2-fat rectangle that contains the centers of at least n/3 squares. Thus every 2-fat rectangle smaller than R₀ contains fewer than n/3 squares.

For every t in [0,1), let R_t be a 2-fat rectangle with the same center as R₀, inflated by 1 + t.

Now it remains to show that there is a t for which R_t intersects at most O(sqrt(n)) squares.

First, consider all the "large squares" – the squares whose side-length is at least width ⁡ ( R 0 ) / 2 n . For every t, the perimeter of R_t is at most 2·perimeter(R₀) which is at most 6·width(R₀), so it can intersect at most 12 n large squares.

Next, consider all the "small squares" – the squares whose side-length is less than width ⁡ ( R 0 ) / 2 n .

For every t, define: intersect(t) as the set of small squares intersected by the boundary of R_t. For every t₁ and t₂, if | t 1 − t 2 | ≥ 1 / n , then | width ⁡ ( R t 1 ) − width ⁡ ( R t 2 ) | ≥ width ⁡ ( R 0 ) / n . Therefore there is a gap of at least width ⁡ ( R 0 ) / 2 n between the boundary of R_t1 and the boundary of R_t2. Therefore, intersect(t₁) and intersect(t₂) are disjoint. Therefore:

Therefore by the pigeonhole principle there is a certain j₀ for which:

The separator we look for is the rectangle R_t, where t = j 0 / n .

Application example

Using this separator theorem, we can solve certain problems in computational geometry in the following way:

Generalizations

The above theorem can be generalized in many different ways, with possibly different constants. For example:

Optimality

The ratio of 1:2, in the square separator theorem above, is the best that can be guaranteed: there are collections of shapes that cannot be separated in a better ratio using a separator that crosses only O(sqrt(n)) shapes. Here is one such collection (from theorem 34 of ):

Consider an equilateral triangle. At each of its 3 vertices, put N/3 shapes arranged in an exponential spiral, such that the diameter increases by a constant factor every turn of the spiral, and each shape touches its neighbours in the spiral ordering. For example, start with a 1-by-Φ rectangle, where Φ is the golden ratio. Add an adjacent Φ-by-Φ square and get another golden rectangle. Add an adjacent (1+Φ)-by-(1+Φ) square and get a larger golden rectangle, and so on.

Now, in order to separate more than 1/3 of the shapes, the separator must separate O(N) shapes from two different vertices. But to do this, the separator must intersect O(N) shapes.

Proof

Define W as the most western vertical line with at least N/4 rectangles entirely to its west. There are two cases:

Optimality

The number of intersected shapes, guaranteed by the above theorem, is O(N). This upper bound is asymptotically tight even when the shapes are squares, as illustrated in the figure to the right. This is in sharp contrast to the upper bound of O(√N) intersected shapes, which is guaranteed when the separator is a closed shape (see previous section).

Moreover, when the shapes are arbitrary rectangles, there are cases in which no line that separates more than a single rectangle can cross less than N/4 rectangles, as illustrated in the figure to the right.

Generalizations

The above theorem can be generalized from disjoint rectangles to k-thick rectangles. Additionally, by induction on d, it is possible to generalize the above theorem to d dimensions and get the following theorem:

For the special case when k = N − 1 (i.e. each point is contained in at most N − 1 boxes), the following theorem holds:

The objects need not be boxes, and the separators need not be axis-parallel:

Algorithmic versions

It is possible to find the hyperplanes guaranteed by the above theorems in O(Nd) steps. Also, if the 2d lists of the lower and upper endpoints of the intervals defining the boxes's ith coordinates are pre-sorted, then the best such hyperplane (according to a wide variety of optimality measures) may be found in O(Nd) steps.

Proof sketch

Define the centerpoint of Q as a point o such that every line through it has at most 2n/3 points of Q in each side of it. The existence of a centerpoint can be proved using Helly's theorem.

For a given point p and constant a>0, define Pr(a,p,o) as the probability that a random line through o lies at a distance of less than a from p. The idea is to bound this probability and thus bound the expected number of points at a distance less than a from a random line through o. Then, by the pigeonhole principle, at least one line through o is the desired separator.

Applications

Bounded-width separators can be used for approximately solving the protein folding problem. It can also be used for an exact sub-exponential algorithm to find a maximum independent set, as well as several related covering problems, in geometric graphs.

Geometric separators and planar graph separators

The planar separator theorem may be proven by using the circle packing theorem to represent a planar graph as the contact graph of a system of disks in the plane, and then by finding a circle that forms a geometric separator for those disks.