Generating a simple polygonalizations
V Muravitskiy, V Tereshchenko - 2011 15th International …, 2011 - ieeexplore.ieee.org
V Muravitskiy, V Tereshchenko
2011 15th International Conference on Information Visualisation, 2011•ieeexplore.ieee.orgWe 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 (n 3) time and using O (n 2) memory.
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 (n 3) time and using O (n 2) memory.
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(n 3 ) time and using O(n 2 ) memory.
ieeexplore.ieee.org