Monotone polygons using linked list
Kamaljit Pati, Anandi Bharwani, Priyam Dhanuka, Manas Kumar Mohanty, Sanjib Sadhu · 2015
Two heuristics have been designed to generate a random monotone polygon from a given set of `n' points lying on a 2-Dimensional plane. The first algorithm runs in O(n2) time using constant work space algorithm. The second algorithm is designed using dynamic memory allocation to generate x-monotone in O(n) time with a preprocessing time complexity of O(nlogn).