Constructing A Simple Polygonalizations

V. Tereshchenko, V. Muravitskiy
2011 Zenodo  
We consider the methods of construction simple polygons for a set S of n points and applying them for searching the minimal area polygon. In this paper we propose the approximate algorithm, which generates the simple polygonalizations of a fixed set of points and finds the minimal area polygon, in O (n3) time and using O(n2) memory.
doi:10.5281/zenodo.1060925 fatcat:4x45yvtudzfapmdbwxl3qmjjaa