An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons

DOI10.1016/0020-0190(94)00128-6zbMath0942.68740OpenAlexW2016629591MaRDI QIDQ1336739

Bern-Cherng Liaw, Richard Chia-Tung Lee

Publication date: 8 December 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00128-6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Cooperative mobile guards in grids ⋮ Guarding a Polygon Without Losing Touch ⋮ Art gallery theorems for guarded guards. ⋮ Packing \([1, \Delta \)-factors in graphs of small degree]

Cites Work

• A combinatorial theorem in plane geometry
• Recognizing visibility graphs of spiral polygons
• Computational complexity of art gallery problems
• THE TWO GUARDS PROBLEM

This page was built for publication: An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons