LIPIcs - Leibniz International Proceedings in Informatics. 32nd International Symposium on Computational Geometry (SoCG 2016)
Doi
Abstract
It is proved that the total length of any set of countably many rectifiable curves, whose union meets all straight lines that intersect the unit square U, is at least 2.00002. This is the first improvement on the lower bound of 2 by Jones in 1964. A similar bound is proved for all convex sets U other than a triangle
