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

DOI10.1016/0020-0190(94)00128-6MaRDI QIDQ1336739zbMATHOpenAlexFDO

Authors Bern-Cherng Liaw, R. C. T. 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)

Cites work

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

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336739)