, Volume 67, Issue 2, pp 117-128

A Problem of Blocking Light Rays

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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?