Heuristic algorithms for finding area constrained non-convex K-gons

The non-convex k-gon of a point set S of size n (n > k) is a non-convex simple polygon which spans k vertices. In this work, we address the problems to compute the optimum area, maximum/minimum area non-convex k-gon and then we propose a heuristic algorithm to obtain the area optimized k-gons.