Malaysian Journal of Mathematical Sciences, March 2016, Vol. 10(S)
Special Issue: The 10th IMT-GT International Conference on Mathematics, Statistics and its Applications 2014 (ICMSA 2014)
Heuristic Algorithms for Finding Area Constrained Non-Convex $k$-gons
Amal Dev Parakkat and Philumon Joseph
Corresponding Email: adp.upasana@gmail.com
Received date: -
Accepted date: -
Abstract:
The non-convex $k$-gon of a point set $S$ of size n ($n \geq 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.
Keywords: NP class, non-convex polygons, $k$-gons, computational mathematics, Heuristic algorithm, area optimized polygons
Indexing
