Title :
Generating a Simple Polygonalizations
Author :
Muravitskiy, V. ; Tereshchenko, V.
Author_Institution :
Nat. Taras Shevchenko, Univ. of Kiev, Kiev, Ukraine
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 point set and finds the minimum area polygon, in O(n3) time and using O(n2) memory.
Keywords :
approximation theory; computational geometry; approximate algorithm; area polygon; fixed point set; simple polygonalizations; Approximation algorithms; Approximation methods; Buildings; Complexity theory; Geometry; Greedy algorithms; Shape; approximate algorithm; minimal area polygon; polygonalizations; simple polygon;
Conference_Titel :
Information Visualisation (IV), 2011 15th International Conference on
Conference_Location :
London
Print_ISBN :
978-1-4577-0868-8
