Extremal convex polygons inscribed in a given convex polygon

Csenge Lili Ködmön, Zsolt Lángi

A convex polygon $Q$ is inscribed in a convex polygon $P$ if every side of $P$ contains at least one vertex of $Q$. We present algorithms for finding a minimum area and a minimum p…