
Stabbing pairwise intersecting disks by five points
We present an O(n) expected time algorithm and an O(n n) deterministic ...
read it

A Fast Algorithm for the Product Structure of Planar Graphs
Dujmović et al (FOCS2019) recently proved that every planar graph G is a...
read it

Rollercoasters and Caterpillars
A rollercoaster is a sequence of real numbers for which every maximal co...
read it

Delaunay Triangulations of Points on Circles
Delaunay triangulations of a point set in the Euclidean plane are ubiqui...
read it

An Instanceoptimal Algorithm for Bichromatic Rectangular Visibility
Afshani, Barbay and Chan (2017) introduced the notion of instanceoptima...
read it

The Crossing Tverberg Theorem
Tverberg's theorem is one of the cornerstones of discrete geometry. It s...
read it

Local Computation Algorithms for the Lovász Local Lemma
We consider the task of designing Local Computation Algorithms (LCA) for...
read it
Stabbing Pairwise Intersecting Disks by Four Points
Following the seminal works of Danzer (1956, 1986) and Stachó (1965,1981), and the recent result of HarPeled et. al. (2018), we study the problem of stabbing disks by points. We prove that any set of pairwise intersecting disks in the plane can be stabbed by four points. Our proof is constructive and yields a lineartime algorithm for finding the points.
READ FULL TEXT
Comments
There are no comments yet.