Loading...
research article
A lower bound on opaque sets
July 1, 2019
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 known since 1964. A similar bound is proved for all convex sets U other than a triangle. (C) 2019 Published by Elsevier B.V.
Type
research article
Web of Science ID
WOS:000466832800002
Author(s)
Date Issued
2019-07-01
Publisher
Published in
Volume
80
Start page
13
End page
22
Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
Available on Infoscience
June 18, 2019
Use this identifier to reference this record