A Problem of Blocking Light Rays
- Cite this article as:
- Zong, C. Geometriae Dedicata (1997) 67: 117. doi:10.1023/A:1004974630549
Let K be an n-dimensional convex body with interior int(K). This article mainly deals with the following problem: How many nonoverlapping translates of K (or int(K)) are enough to block all the light rays (straight lines) starting from K?