Peeling Rotten Potatoes for a Faster Approximation of Convex Cover

Omrit Filtser, Tzalik Maimon, Ofir Yomtovyan

The minimum convex cover problem seeks to cover a polygon $P$ with the fewest convex polygons that lie within $P$. This problem is $\exists \mathbb{R}$-complete, and the best previou…