Illuminating sets of constant width

Abstract

The problem of illuminating the boundary of sets having constant width is considered and a bound for the number of directions needed is given. As a corollary, an estimate for Borsuk's partition problem is inferred. Also, the illumination number of sufficiently symmetric strictly convex bodies is determined.