LIPIcs.SoCG.2016.46.pdf
- Filesize: 0.55 MB
- 10 pages
Document
A Lower Bound on Opaque Sets
Authors
-
Part of:
Volume:
32nd International Symposium on Computational Geometry (SoCG 2016)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Computational Geometry (SoCG) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2016-06-10
Cite AsGet BibTex
Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, and János Pach. A Lower Bound on Opaque Sets. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 46:1-46:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.SoCG.2016.46
https://doi.org/10.4230/LIPIcs.SoCG.2016.46
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.
Keywords
- barriers; Cauchy-Crofton formula; lower bound; opaque sets
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads