GUARDING SIMPLE POLYGONS WITH SEMI-OPEN EDGE GUARDS

Asish Kumar Mukhopadhyay, Chris Drouillard, Godfried Toussaint · 2013

In this note we explore an upper bound on the number of semi-open guard edges in a non star-shaped polygon and provide a characterization to detect semi-open guard edges. Based on this characterization we propose an O(n) time al-gorithm to find all semi-open guard edges in a polygon.

Read the paper · More papers on PaperTik