A lower bound on opaque sets

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

Research output: Contribution to journalArticle

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 known since 1964. A similar bound is proved for all convex sets U other than a triangle.

Original languageEnglish
Pages (from-to)13-22
Number of pages10
JournalComputational Geometry: Theory and Applications
Volume80
DOIs
Publication statusPublished - Jul 2019

Fingerprint

Intersect
Straight Line
Convex Sets
Triangle
Union
Lower bound
Curve
Unit

All Science Journal Classification (ASJC) codes

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

Cite this

A lower bound on opaque sets. / Kawamura, Akitoshi; Moriyama, Sonoko; Otachi, Yota; Pach, János.

In: Computational Geometry: Theory and Applications, Vol. 80, 07.2019, p. 13-22.

Research output: Contribution to journalArticle

Kawamura, Akitoshi ; Moriyama, Sonoko ; Otachi, Yota ; Pach, János. / A lower bound on opaque sets. In: Computational Geometry: Theory and Applications. 2019 ; Vol. 80. pp. 13-22.
@article{ecaacb3104ee4c45ba0516959fa2af59,
title = "A lower bound on opaque sets",
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 known since 1964. A similar bound is proved for all convex sets U other than a triangle.",
author = "Akitoshi Kawamura and Sonoko Moriyama and Yota Otachi and J{\'a}nos Pach",
year = "2019",
month = "7",
doi = "10.1016/j.comgeo.2019.01.002",
language = "English",
volume = "80",
pages = "13--22",
journal = "Computational Geometry: Theory and Applications",
issn = "0925-7721",
publisher = "Elsevier",

}

TY - JOUR

T1 - A lower bound on opaque sets

AU - Kawamura, Akitoshi

AU - Moriyama, Sonoko

AU - Otachi, Yota

AU - Pach, János

PY - 2019/7

Y1 - 2019/7

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85061302923&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85061302923&partnerID=8YFLogxK

U2 - 10.1016/j.comgeo.2019.01.002

DO - 10.1016/j.comgeo.2019.01.002

M3 - Article

AN - SCOPUS:85061302923

VL - 80

SP - 13

EP - 22

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

SN - 0925-7721

ER -