Skip to search boxSkip to navigationSkip to main content

Hiding in the crowd: asymptotic bounds on blocking sets

  • N. Jovanovic
    ,
  • J.H.M. Korst
    ,
  • Z. Aleksovski
    ,
  • R. Jovanovic
Output:
Contribution to conference
Paper
Academic

Information

Output type

Output:
Contribution to conference
Paper
Academic

Original language

English

Pages from-to (Number of pages)

Pages 197-200 (4 pages)

Publication milestones

  • Published - 2010

Publication status

Published - 2010

Related Event

Title

26th European Workshop on Computational Geometry (EuroCG 2010)

Description

26th European Workshop on Computational Geometry (EuroCG 2010)

Event type

Workshop

Date

22/03/2010 - 24/03/2010

Location

Dortmund

Abstract

We consider the problem of blocking all rays emanating from a unit disk U by a minimum number N_d of unit disks in the two-dimensional space, where each disk has at least a distance d to any other disk. We study the asymptotic behavior of N_d, as d tends to infinity. Using a regular ordering of disks on concentric circular rings we derive upper and lower bounds and prove that $\frac{\pi^2}{16} \leq \frac{N_d}{d^2} \leq \frac{\pi^2}{2}$, as d goes to infinity.