Two-convex polygons
Oswin Aichholzer, Franz Aurenhammer, Fernando Alfredo Hurtado Díaz, Pedro A. Ramos, Jorge Urrutia · UPCommons institutional repository (Universitat Politècnica de Catalunya) · 2009
We introduce a notion of k-convexity and explore some properties of polygons that have this property. In particular, 2-convex polygons can be recognized in O(n log n) time, and k-convex polygons can be triangulated in O(kn) time.