# Balanced Line Separators of Unit Disk Graphs

@inproceedings{Carmi2017BalancedLS,
title={Balanced Line Separators of Unit Disk Graphs},
author={Paz Carmi and Man-Kwun Chiu and Matthew J. Katz and Matias Korman and Yoshio Okamoto and Andr{\'e} van Renssen and Marcel Roeloffzen and Taichi Shiitada and Shakhar Smorodinsky},
year={2017}
}
• Published in WADS 31 July 2017
• Mathematics, Computer Science
We prove a geometric version of the graph separator theorem for the unit disk intersection graph: for any set of $n$ unit disks in the plane there exists a line $\ell$ such that $\ell$ intersects at most $O(\sqrt{(m+n)\log{n}})$ disks and each of the halfplanes determined by $\ell$ contains at most $2n/3$ unit disks from the set, where $m$ is the number of intersecting pairs of disks. We also show that an axis-parallel line intersecting $O(\sqrt{m+n})$ disks exists, but each halfplane may…
3 Citations
Halving balls by a hyperplane in deterministic linear time
• Mathematics, Computer Science
• 2020
The results improve the runtime of a disk sliding algorithm by Bereg, Dumitrescu and Pach and simplify and derandomize an algorithm to construct a space decomposition used by Loffler and Mulzer to construct an onion (convex layer) decomposition for imprecise points.
Space-Efficient Algorithms for Reachability in Directed Geometric Graphs
• Mathematics, Computer Science
ISAAC
• 2021
This paper shows that for every ε > 0, there exists a polynomial time algorithm that can solve Reachability in an n vertex directed penny graph, using O(n1/4+ε) space.
Space-Efficient Algorithms for Reachability in Geometric Graphs
• Mathematics, Computer Science
ArXiv
• 2021
This paper shows that for every ε > 0, there exists a polynomial-time algorithm that can solve Reachability in an n vertex directed penny graph, using O(n1/4+ε) space.

## References

SHOWING 1-10 OF 27 REFERENCES
A Separator Theorem for Graphs of Bounded Genus
• Mathematics, Computer Science
J. Algorithms
• 1984
Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition
• Computer Science
J. Comput. Geom.
• 2014
The solution is based on a recursive space decomposition, combined with a fast algorithm to compute the union of two disjoint onion, and provides a matching lower bound.
Near-Optimal Separators in String Graphs
• J. Matousek
• Mathematics
Combinatorics, Probability and Computing
• 2013
Fox and Pach proved that G has a separator consisting of $O(m^{3/4}\sqrt{\log m})$ vertices, and they conjectured that the bound of O(\sqrt m)\$ actually holds.
Halving Balls in Deterministic Linear Time
• Mathematics
ESA
• 2014
This work states that it is desirable that the separating hyperplane intersects a small number of balls only, which generalizes the notion of halving hyperplanes (n/2-separators).
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 separator theorem for nonplanar graphs
• Mathematics
• 1990
Let G be an n-vertex graph with no minor isomorphic to an h- vertex complete 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
Geometric separator theorems and applications
• Mathematics
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
• 1998
A large number of "geometric separator theorems" are found, such as subexponential algorithms for traveling salesman tour and rectilinear Steiner minimal tree in R/sup d/, new point location algorithms, and new upper and lower bound proofs for "planar separatorTheorems".
Geometric Separators and Their Applications to Protein Folding in the HP-Model
• Computer Science, Mathematics
SIAM J. Comput.
• 2007
A new method for deriving a geometric separator has a linear structure, which can effectively partition a grid graph, and is applied to develop an exact algorithm for the protein-folding problem in the HP-model, which is NP-hard both in both two and three dimensions.
Short and Simple Cycle Separators in Planar Graphs
• Computer Science
ACM J. Exp. Algorithmics
• 2016
This work provides an implementation of an algorithm that, given a triangulated planar graph with m edges, returns a simple cycle that is a 3/4-balanced separator consisting of at most √8m edges, the first implementation of such a cycle separator algorithm with a worst-case guarantee on the cycle length.