Generating a Simple Polygonalizations
V. Muravitskiy, Vasyl Tereshchenko · 2011 15th International Conference on Information Visualisation · 2011
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 point set and finds the minimum area polygon, in O(n3) time and using O(n2) memory.