Illumination of Orthogonal Polygons with Orthogonal Floodlights-Reference-Cited by-同舟云学术

Illumination of Orthogonal Polygons with Orthogonal Floodlights

Published:1998-02 Issue:01 Volume:08 Page:25-38
ISSN:0218-1959
Container-title:International Journal of Computational Geometry & Applications
language:en
Short-container-title:Int. J. Comput. Geom. Appl.

Author:

Abello James¹,Estivill-Castro Vladimir²,Shermer Thomas³,Urrutia Jorge⁴

Affiliation:

1. AT&T Research, 600 Mountain Av., Murray Hill, NJ 07974, USA

2. School of Information Systems, Queensland University of Technology, Brisbane, Queensland 4000, Australia

3. School of Computing Science, Simon Fraser University, Burnaby, B.C., V5A 1S6, Canada

4. Department of Computer Science, University of Ottawa, Ottawa, K1N 6N5, Canada

Abstract

We provide the first tight bound for covering an orthogonal polygon with n vertices and h holes with vertex floodlights (guards with restricted angle of vision). In particular, we provide tight bounds for the number of orthogonal floodlights, placed at vertices or on the boundary, sufficient to illuminate the interior or the exterior of an orthogonal polygon with holes. Our results lead directly to very simple linear, and thus optimal, algorithms for computing a covering of an orthogonal polygon.

Publisher

World Scientific Pub Co Pte Lt

Subject

Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218195998000035

Reference6 articles.

1. Recent results in art galleries (geometry)

2. COMPUTATIONAL GEOMETRY COLUMN 16

3. Traditional Galleries Require Fewer Watchmen

4. Illumination of polygons with vertex lights

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

1. The dispersive art gallery problem;Computational Geometry;2024-02

2. On Half Guarding Polygons;Combinatorial Optimization and Applications;2023-12-09

3. Separating bichromatic point sets in the plane by restricted orientation convex hulls;Journal of Global Optimization;2022-10-10

4. A fast and efficient algorithm for determining the connected orthogonal convex hulls;Applied Mathematics and Computation;2022-09

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