Affiliation:
1. Stony Brook University
2. Linköping University
Funder
National Science Foundation
Reference32 articles.
1. Covering Polygons is Even Harder
2. The art gallery problem is ∃ ℝ-complete
3. A 1/4-approximation algorithm for the maximum hidden vertex set problem in simple polygons;Alegría
4. LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
5. An approximation algorithm for the art gallery problem;Bonnet;arXiv preprint arXiv:1607.05527,2016