Minimum blocking sets of circles for a set of lines in the plane
| Autor: | Jovanovic, N., Korst, J.H.M., Janssen, A.J.E.M. |
|---|---|
| Přispěvatelé: | Mathematics and Computer Science |
| Jazyk: | angličtina |
| Rok vydání: | 2008 |
| Zdroj: | Proceedings 20th Canadian Conference on Computational Geometry (CCCG'08, Montréal, Québec, Canada, August 13-15, 2008), 91-94 STARTPAGE=91;ENDPAGE=94;TITLE=Proceedings 20th Canadian Conference on Computational Geometry (CCCG'08, Montréal, Québec, Canada, August 13-15, 2008) |
| Popis: | A circle C is occluded by a set of circles C1; : : : ;Cn if every line that intersects C also intersects at least one of the Ci; i = 1; : : : ; n. In this paper, we focus on determining the minimum number of circles that occlude a given circle assuming that all circles have radius 1 and their mutual distance is at least d. As main contribution of this paper, we present upper and lower bounds on this minimal number of circles for 2 =d =4, as well as the algorithms we used to derive them. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|