Guarding galleries and terrains-Reference-Cited by-同舟云学术

Guarding galleries and terrains

Published:2006-12 Issue:6 Volume:100 Page:238-245
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Efrat Alon,Har-Peled Sariel

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference26 articles.

1. A. Aggarwal, The art gallery problem: Its variations, applications, and algorithmic aspects, PhD thesis, Dept. of Comput. Sci., Johns Hopkins University, 1984

2. Almost optimal set covers in finite VC-dimension;Bronnimann;Discrete Comput. Geom.,1995

3. On the combinatorial and algebraic complexity of quantifier elimination;Basu;J. ACM,1996

4. I. Bjorling-Sachs, Variations on the Art Gallery Theorem, PhD thesis, Rutgers University, 1993

5. Algorithms for polytope covering and approximation;Clarkson,1993

Cited by 46 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Parameterized Complexity of Guarding Almost Convex Polygons;Discrete & Computational Geometry;2023-12-05

2. Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple Polygon;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces;Operations Research Letters;2023-09

4. The Art Gallery Problem is ∃ℝ-complete;Journal of the ACM;2022-02-28

5. On the Complexity of Half-Guarding Monotone Polygons;LATIN 2022: Theoretical Informatics;2022