An algorithm for determining an opaque minimal forest of a convex polygon (Q1107998)

Let P be a convex polygon with n vertices in the Euclidean plane. An `opaque forest' for P, denoted F(P), is a finite set of line segments inside or on P so that every line intersecting P also intersects at least one member of F(P). We give an algorithm which computes an opaque minimal (in the \(L_ 2\) sense) forest, \(F^*(P)\), in \(O(n^ 6)\) time using \(O(n^ 2)\) space.