%0 Journal Article
	%A V. Tereshchenko and  V. Muravitskiy
	%D 2011
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 53, 2011
	%T Constructing a Simple Polygonalizations
	%U https://publications.waset.org/pdf/5368
	%V 53
	%X 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.
	%P 493 - 496