On a generalization of Tarski's plank problem (Q2464355)

The famous Tarski's plank problem, proved by Bang in 1951, states that if a closed convex set \(C\) in the Euclidean plane is covered by a finite number of strips, then the sum of their widths is greater than or equal to the (minimal) width of \(C\). In this paper the author proves the following generalization of Tarski's problem: if the unit disk \(B^2\) is partitioned into \(n\) convex cells with inradii \(r_i\), then \(\sum_{i=1}^nr_i\geq 1\). This result is obtained as a consequence of a more general theorem, namely: if \(T\) is a triangle (or strip) in the plane and \(r\) is the inradius of \(T\cap B^2\), then the orthogonal projection of \(T\cap B^2\) onto the (closed) hemisphere raised over \(B^2\) has area less than or equal to \(2\pi r\); moreover, equality holds if and only if \(T\) is the strip of width \(2r\) crossing \(B^2\).