@article{(Open Science Index):https://publications.waset.org/pdf/5368, title = {Constructing a Simple Polygonalizations}, author = {V. Tereshchenko and V. Muravitskiy}, country = {}, institution = {}, abstract = {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.}, journal = {International Journal of Computer and Information Engineering}, volume = {5}, number = {5}, year = {2011}, pages = {493 - 496}, ee = {https://publications.waset.org/pdf/5368}, url = {https://publications.waset.org/vol/53}, bibsource = {https://publications.waset.org/}, issn = {eISSN: 1307-6892}, publisher = {World Academy of Science, Engineering and Technology}, index = {Open Science Index 53, 2011}, }