DeepAI AI Chat
Log In Sign Up

Balanced Line Separators of Unit Disk Graphs

by   Paz Carmi, et al.

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 ℓ such that ℓ intersects at most O(√((m+n)n)) disks and each of the halfplanes determined by ℓ 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(√(m+n)) disks exists, but each halfplane may contain up to 4n/5 disks. We give an almost tight lower bound (up to sublogarithmic factors) for our approach, and also show that no line-separator of sublinear size in n exists when we look at disks of arbitrary radii, even when m=0. Proofs are constructive and suggest simple algorithms that run in linear time. Experimental evaluation has also been conducted, which shows that for random instances our method outperforms the method by Fox and Pach (whose separator has size O(√(m))).


page 1

page 2

page 3

page 4


Sparse Hop Spanners for Unit Disk Graphs

A unit disk graph G on a given set of points P in the plane is a geometr...

A tight bound for the number of edges of matchstick graphs

A matchstick graph is a plane graph with edges drawn as unit-distance li...

Classifying Convex Bodies by their Contact and Intersection Graphs

Suppose that A is a convex body in the plane and that A_1,...,A_n are tr...

The Complexity of Simultaneous Geometric Graph Embedding

Given a collection of planar graphs G_1,...,G_k on the same set V of n v...

Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs

We initiate the study of diameter computation in geometric intersection ...

A Finite Algorithm for the Realizabilty of a Delaunay Triangulation

The Delaunay graph of a point set P ⊆ℝ^2 is the plane graph with the ver...

Covering a set of line segments with a few squares

We study three covering problems in the plane. Our original motivation f...