A lower bound on opaque sets

Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach

研究成果: Contribution to journalArticle


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.

ジャーナルComputational Geometry: Theory and Applications
出版物ステータス出版済み - 7 2019

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Geometry and Topology
  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics

フィンガープリント A lower bound on opaque sets' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用