Improving the lower bound on opaque sets for equilateral triangle

DOI10.1016/J.DAM.2016.05.006zbMATH Open1350.52001arXiv1509.03846OpenAlexW2416484622MaRDI QIDQ313808FDOQ313808

Taisuke Izumi

Publication date: 12 September 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: An opaque set (or a barrier) for $Usubseteqmathbb{R}^2$ is a set $B$ of finite-length curves such that any line intersecting $U$ also intersects $B$. In this paper, we consider the lower bound for the shortest barrier when $U$ is the unit equilateral triangle. The known best lower bound for triangles is the classic one by Jones [Jones,1964], which exhibits that the length of the shortest barrier for any convex polygon is at least the half of its perimeter. That is, for the unit equilateral triangle, it must be at least $3/2$. Very recently, this lower bounds are improved for convex $k$-gons for any $kgeq4$ [Kawamura et al. 2014], but the case of triangles still lack the bound better than Jones' one. The main result of this paper is to fill this missing piece: We give the lower bound of $3/2+5cdot10^{-13}$ for the unit-size equilateral triangle. The proof is based on two new ideas, angle-restricted barriers and a weighted sum of projection-cover conditions, which may be of independently interest.

Full work available at URL: https://arxiv.org/abs/1509.03846

Recommendations

• The opaque square
• Opaque sets
• Opaque sets
• A lower bound on opaque sets
• A lower bound on opaque sets

zbMATH Keywords

computational geometrylower boundopaque setunit-size equilateral triangle

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10)

Cites Work

• An algorithm for determining an opaque minimal forest of a convex polygon
• An \(O(n^ 3)\) algorithm for finding the minimal opaque forest of a convex polygon
• A counterexample to the algorithms for determining opaque minimal forests
• The Shortest Curve that Meets all the Lines that Meet a Convex Body
• A Lower Bound on Opaque Sets
• The Opaque Square
• Opaque sets
• Computing Opaque Interior Barriers à la Shermer
• Opaque Sets of Degree &#945

Cited In (1)

• A lower bound on opaque sets

This page was built for publication: Improving the lower bound on opaque sets for equilateral triangle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313808)