Covering simple orthogonal polygons with r-stars
classification
🧮 math.CO
cs.CG
keywords
orthogonalpolygonssimplecoveringproblemguardknownpoint
read the original abstract
We solve the $r$-star covering problem in simple orthogonal polygons, also known as the point guard problem in simple orthogonal polygons with rectangular vision, in quadratic time.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.