An alternative approach for computing monotone polygon
Priyam Dhanuka, Anandi Bharwani, Kamaljit Kaur, Manas Kumar Mohanty, Sanjib Sadhu · 2015
An algorithm has been designed to compute a random monotone polygon from an input set of points lying on a 2-D dimensional plane. Our algorithm is based on sweep line method with some modifications and it computes monotone polyogn in O(nlogn) time complexity and O(n) space complexity. LEDA software has been used to execute our algorithm.