Improving the lower bound on opaque sets for equilateral triangle

DOI10.1016/j.dam.2016.05.006zbMath1350.52001arXiv1509.03846OpenAlexW2416484622MaRDI QIDQ313808

Taisuke Izumi

Publication date: 12 September 2016

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

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

zbMATH Keywords

lower boundcomputational geometryopaque setunit-size equilateral triangle

Mathematics Subject Classification ID

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

Related Items

A lower bound on opaque sets

Cites Work

• Opaque sets
• 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
• Computing Opaque Interior Barriers à la Shermer
• Opaque Sets of Degree &#945