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

doi:10.1145/1542362.1542394

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

Mathematics and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-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 language	English
Title of host publication	Proceedings 25th Annual ACM Symposium on Computational Geometry (SoCG'09, Aarhus, Denmark, June 8-10, 2009)
Place of Publication	New York NY
Publisher	Association for Computing Machinery, Inc
Pages	148-152
ISBN (Print)	978-1-60558-501-7
DOIs	https://doi.org/10.1145/1542362.1542394
Publication status	Published - 2009

Access to Document

10.1145/1542362.1542394

Cite this

Jovanovic, N., Korst, J. H. M., Clout, R. A. W., Pronk, S. P. P., & Tolhuizen, L. M. G. M. (2009). Candle in the woods: Asymptotic bounds on minimum blocking sets. In Proceedings 25th Annual ACM Symposium on Computational Geometry (SoCG'09, Aarhus, Denmark, June 8-10, 2009) (pp. 148-152). Association for Computing Machinery, Inc. https://doi.org/10.1145/1542362.1542394

@inproceedings{9cf6a4cef9cf4588bf4c794bb9e3a8ce,

title = "Candle in the woods: Asymptotic bounds on minimum blocking sets",

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",

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

year = "2009",

doi = "10.1145/1542362.1542394",

language = "English",

isbn = "978-1-60558-501-7",

pages = "148--152",

booktitle = "Proceedings 25th Annual ACM Symposium on Computational Geometry (SoCG'09, Aarhus, Denmark, June 8-10, 2009)",

publisher = "Association for Computing Machinery, Inc",

address = "United States",

}

Candle in the woods: Asymptotic bounds on minimum blocking sets. / Jovanovic, N.; Korst, J.H.M.; Clout, R.A.W. et al.
Proceedings 25th Annual ACM Symposium on Computational Geometry (SoCG'09, Aarhus, Denmark, June 8-10, 2009). New York NY: Association for Computing Machinery, Inc, 2009. p. 148-152.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Candle in the woods: Asymptotic bounds on minimum blocking sets

AU - Jovanovic, N.

AU - Korst, J.H.M.

AU - Clout, R.A.W.

AU - Pronk, S.P.P.

AU - Tolhuizen, L.M.G.M.

PY - 2009

Y1 - 2009

N2 - 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

AB - 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

U2 - 10.1145/1542362.1542394

DO - 10.1145/1542362.1542394

M3 - Conference contribution

SN - 978-1-60558-501-7

SP - 148

EP - 152

BT - Proceedings 25th Annual ACM Symposium on Computational Geometry (SoCG'09, Aarhus, Denmark, June 8-10, 2009)

PB - Association for Computing Machinery, Inc

CY - New York NY

ER -

Candle in the woods: Asymptotic bounds on minimum blocking sets

Abstract

Access to Document

Fingerprint

Cite this