A note on guarding staircase polygons
Matt Gibson , Erik Krohn , Bengt J. Nilsson , Matthew Rayford , Paweł Żyliński
AbstractWe exhibit two linear time approximation algorithms for guarding rectilinear staircase polygons both having approximation factor 2. The first algorithm benefits from its simplicity, where as the second provides more insight to the problem.
|Document type||paper presented|
|Conference||31st Canadian Conference on Computational Geometry (CCCG 2019), 08-08-2019 - 10-08-2019, Edmonton, Kanada|