Pith. sign in

REVIEW

Mobile vs. point guards

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 1706.02619 v3 pith:GP44TTDK submitted 2017-06-08 math.CO cs.CG

Ervin Győri , Tamás Róbert Mezei This is my paper · ORCID
classification math.COcs.CG
keywords guardsmobileminimumnumberpointcovergalleryhorizontal
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We study the problem of guarding orthogonal art galleries with horizontal mobile guards (alternatively, vertical) and point guards, using "rectangular vision". We prove a sharp bound on the minimum number of point guards required to cover the gallery in terms of the minimum number of vertical mobile guards and the minimum number of horizontal mobile guards required to cover the gallery. Furthermore, we show that the latter two numbers can be calculated in linear time.

Discussion (0). Continue with ORCID to comment.

Pith tools