REVIEW 1 cited by
Minimum Opaque Covers for Polygonal Regions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The Opaque Cover Problem (OCP), also known as the Beam Detector Problem, is the problem of finding, for a set S in Euclidean space, the minimum-length set F which intersects every straight line passing through S. In spite of its simplicity, the problem remains remarkably intractable. The aim of this paper is to establish a framework and fundamental results for minimum opaque covers where S is a polygonal region in two-dimensional space. We begin by giving some general results about opaque covers, and describe the close connection that the OCP has with the Point Goalie Problem. We then consider properties of graphical solutions to the OCP when S is a convex polygonal region in the plane.
Forward citations
Cited by 1 Pith paper
-
A General Solution to Bellman's Lost-in-a-forest Problem
The paper reformulates Bellman's lost-in-a-forest problem as a traveling-salesman-style optimization over rotated and translated forest boundaries, but the promised general solution lacks a rigorous convergence proof ...
Discussion (0). Continue with ORCID to comment.