2000 character limit reached
A lower bound on opaque sets
Published 16 Mar 2014 in cs.CG | (1403.3894v2)
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 established by Jones in 1964. A similar bound is proved for all convex sets U other than a triangle.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.