Asymptotic bounds on minimum number of disks required to hide a disk
| Autor: | Jovanovic, N., Korst, J.H.M., Aleksovski, Z., Jovanovic, R. |
|---|---|
| Přispěvatelé: | Mathematics and Computer Science, Interconnected Resource-aware Intelligent Systems |
| Jazyk: | angličtina |
| Rok vydání: | 2010 |
| Předmět: | |
| Zdroj: | Proceedings of the Fourth International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2010, Florence, Italy, October 25-30, 2010), 160-165 STARTPAGE=160;ENDPAGE=165;TITLE=Proceedings of the Fourth International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2010, Florence, Italy, October 25-30, 2010) |
| Popis: | We consider the problem of blocking all rays emanating from a closed unit disk with a minimum number of closed unit disks in the two-dimensional space, where the minimum distance from a disk to any other disk is given. We study the asymptotic behavior of the minimum number of disks as the minimum mutual distance approaches infinity. Using a regular ordering of disks on concentric circular rings we derive an upper bound and prove that the minimum number of disks required for blocking is quadratic in the minimum distance between the disks. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|