GRP-CH heuristic for generating random simple polygon

Abstract

A heuristic 'GRP-CH' has been proposed to generate a random simple polygon from a given set of 'n' points in 2-Dimensional plane. The "2-Opt Move" heuristic with time complexity O(n4) is the best known (referred in [1]) among the existing heuristics to generate a simple polygon. The proposed heuristics, 'GRP-CH' first computes the convex hull of the point set and then generates a random simple polygon from that convex hull. The 'GRP-CH' heuristic takes O(n3) time which is less than that of "2-opt Move" heuristic. We have compared our results with "2-Opt Move" and it shows that the randomness behaviour of 'GRP-CH' heuristic is better than that of "2-Opt Move" heuristic. © 2012 Springer-Verlag.