Candle in the woods: Asymptotic bounds on minimum blocking sets

N. Jovanovic, J.H.M. Korst, R.A.W. Clout, S.P.P. Pronk, L.M.G.M. Tolhuizen

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

5 Citations (Scopus)

Abstract

We consider the problem of determining the minimum number Nd of unit disks that is required to block all rays emanating from a point P in the two-dimensional space, where each disk has at least a distance d to point P and to any other disk. We study the asymptotic behavior of Nd, as d tends to infinity. By deriving upper bounds and lower bounds, we prove that pi2/16 infinity} N_d/d2
Original languageEnglish
Title of host publicationProceedings 25th Annual ACM Symposium on Computational Geometry (SoCG'09, Aarhus, Denmark, June 8-10, 2009)
Place of PublicationNew York NY
PublisherAssociation for Computing Machinery, Inc
Pages148-152
ISBN (Print)978-1-60558-501-7
DOIs
Publication statusPublished - 2009

Fingerprint Dive into the research topics of 'Candle in the woods: Asymptotic bounds on minimum blocking sets'. Together they form a unique fingerprint.

Cite this