Efficient Enumeration of At Most $k$-Out Polygons

Waseem Akram, Katsuhisa Yamanaka

Let $S$ be a set of $n$ points in the Euclidean plane and general position i.e., no three points are collinear. An \emph{at most $k$-out polygon of $S$} is a simple polygon such th…