On guarding the vertices of rectilinear domains-Reference-Cited by-同舟云学术

On guarding the vertices of rectilinear domains

Published:2008-04 Issue:3 Volume:39 Page:219-228
ISSN:0925-7721
Container-title:Computational Geometry
language:en
Short-container-title:Computational Geometry

Author:

Katz Matthew J.,Roisman Gabriel S.

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications

Reference29 articles.

1. A. Aggarwal, The art gallery theorem: Its variations, applications and algorithmic aspects, PhD thesis, Johns Hopkins University, 1984

2. B. Ben-Moshe, M.J. Katz, J.S.B. Mitchell, A constant-factor approximation algorithm for optimal terrain guarding, in: Proc. 16th ACM–SIAM Sympos. on Discrete Algorithms, 2005, pp. 515–524

3. Guarding polyhedral terrains;Bose;Comput. Geom. Theory Appl.,1997

4. B. Brodén, M. Hammar, B.J. Nilsson, Guarding lines and 2-link polygons is APX-hard, in: Proc. 13th Canad. Conf. Comput. Geom., 2001, pp. 45–48

5. Almost optimal set covers in finite VC-dimension;Brönnimann;Discrete Comput. Geom.,1995

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

1. One-sided terrain guarding and chordal graphs;Discrete Applied Mathematics;2024-05

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

3. Computational Complexity of the Vertex-to-Point Conflict-Free Chromatic Art Gallery Problem;IEICE Transactions on Information and Systems;2023-09-01

4. Parameter Analysis for Guarding Terrains;Algorithmica;2022-01-06

5. Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard;WALCOM: Algorithms and Computation;2022