论文信息 - Finding Shadows among Disks

Finding Shadows among Disks

Given a set of n non-overlapping unit disks in the plane, a line l is called blocked if it intersects at least one of the disks and a point p is called a shadow point if all lines containing p are blocked. In addition, a maximal closed set of shadow points is called a shadow region. We derive properties of shadow regions, and present an O(n^4) algorithm that outputs all shadow regions. We prove that the number of shadow regions is O(n^4) for some instances, which implies that the worst-case time complexity of the presented algorithm is optimal.

[1] Jan H. M. Korst,et al. Candle in the woods: asymptotic bounds on minimum blocking sets , 2009, SCG '09.

[2] Jan H. M. Korst,et al. Minimum blocking sets of circles for a set of lines in the plane , 2008, CCCG.

[3] Ivan J. Balaban,et al. An optimal algorithm for finding segments intersections , 1995, SCG '95.

[4] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .

[5] H. Martini,et al. Combinatorial problems on the illumination of convex bodies , 1999 .

[6] Adrian Dumitrescu,et al. The Forest Hiding Problem , 2010, SODA.

[7] Chuanming Zong,et al. Clouds of Planar Convex Bodies , 2001 .

[8] Mark de Berg,et al. Computational geometry: algorithms and applications, 3rd Edition , 1997 .

[9] Jan Korst,et al. Object Detection in Flatland , 2009, 2009 Third International Conference on Advanced Engineering Computing and Applications in Sciences.