The shortest curve that meets all the lines that meet a convex body
American Mathematical Monthly
An algorithm for determining an opaque minimal forest of a convex polygon
Information Processing Letters
An O(n3) algorithm for finding the minimal opaque forest of a convex polygon
Information Processing Letters
A counterexample to the algorithms for determining opaque minimal forests
Information Processing Letters
| Hi-index | 0.00 |
This column is devoted to opaque sets also known as barriers. A set of curves Γ that meet every line which intersects a given convex body B is called an opaque set or barrier for B. Although the shape and length of shortest barriers for simple bodies, such as a unit equilateral triangle or a unit square are seldom disputed, no proof of optimality is known or appears to be even near in sight.