Generating Kernel Aware Polygons
Bibek Subedi · Digital Scholarship - UNLV (University of Nevada Reno) · 2020
Problems dealing with the generation of random polygons has important applications for evaluating the performance of algorithms on polygonal domain. We review existing algorithms for generating random polygons. We present an algorithm for generating polygons admitting visibility properties. In particular, we propose an algorithm for generating polygons admitting large size kernels. We also present experimental results on generating such polygons.