Computing Opaque Interior Barriers à la Shermer

DOI10.1137/14098805XzbMath1327.68316MaRDI QIDQ5502099

Adrian Dumitrescu, Ming-Hui Jiang, Csaba D. Tóth

Publication date: 17 August 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

isoperimetric inequalityapproximation algorithmopaque barrier

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Isoperimetric problems for polytopes (52B60) Approximation algorithms (68W25)

Related Items (1)

Improving the lower bound on opaque sets for equilateral triangle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Opaque sets
• Some opaque subsets of a square
• Universale Rettungskurven. I. (Universal rescue curves. I)
• 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
• Unsolved problems in geometry
• The Shortest Curve that Meets all the Lines that Meet a Convex Body
• A Lower Bound on Opaque Sets
• The Maximal Inradius of the Convex Cover of a Plane Connected set of Given Length
• The isoperimetric inequality
• The Opaque Square
• On the shortest curve which meets all the lines which meet a circle
• Opaque Sets of Degree &#945
• Curves Intersecting Certain Sets of Great-Circles on the Sphere

This page was built for publication: Computing Opaque Interior Barriers à la Shermer