Stabbing Pairwise Intersecting Disks by Four Points

12/17/2018
by   Ahmad Biniaz, et al.
0

Following the seminal works of Danzer (1956, 1986) and Stachó (1965,1981), and the recent result of Har-Peled 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 linear-time algorithm for finding the points.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/09/2018

Stabbing pairwise intersecting disks by five points

We present an O(n) expected time algorithm and an O(n n) deterministic ...
research
12/11/2021

Piercing Pairwise Intersecting Geodesic Disks by Five Points

Given a simple polygon P on n vertices, and a set D of m pairwise inters...
research
04/06/2020

A Fast Algorithm for the Product Structure of Planar Graphs

Dujmović et al (FOCS2019) recently proved that every planar graph G is a...
research
12/12/2018

The Crossing Tverberg Theorem

Tverberg's theorem is one of the cornerstones of discrete geometry. It s...
research
08/07/2022

Revisiting Random Points: Combinatorial Complexity and Algorithms

Consider a set P of n points picked uniformly and independently from [0,...
research
10/08/2022

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...
research
03/30/2018

Delaunay Triangulations of Points on Circles

Delaunay triangulations of a point set in the Euclidean plane are ubiqui...

Please sign up or login with your details

Forgot password? Click here to reset