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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.