Guarding Galleries and Terrains-Reference-Cited by-同舟云学术

Guarding Galleries and Terrains

Published:2002 Issue: Volume: Page:181-192
ISSN:
Container-title:Foundations of Information Technology in the Era of Network and Mobile Computing
language:
Short-container-title:

Author:

Efrat Alon,Har-Peled Sariel

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-0-387-35608-2_16

Reference25 articles.

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

2. H. Brönnimann and M. T. Goodrich. Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom., 14: 263–279, 1995.

3. S. Basu, R. Pollack, and M.-F. Roy. On the combinatorial and algebraic complexity of quantifier elimination. J. ACM, 43: 1002–1045, 1996.

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

5. B. Chazelle, Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6 (1991) 485–524.

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

1. Topological Art in Simple Galleries;Discrete & Computational Geometry;2023-08-27

2. A nearly optimal algorithm for covering the interior of an Art Gallery;Pattern Recognition;2011-05

3. Efficient Sensor Placement for Surveillance Problems;Distributed Computing in Sensor Systems;2009

4. Towards Optimal Positioning of Surveillance UGVs;Optimization and Cooperative Control Strategies;2009

5. A nearly optimal sensor placement algorithm for boundary coverage;Pattern Recognition;2008-11