Generating Sunflower Random Polygons on a Set of Vertices
نویسنده
چکیده
Abstract Generating random polygons problem is important for verification of geometric algorithms. Moreover, this problem has applications in computing and verification of time complexity for computational geometry algorithms such as Art Gallery. Since it is often not possible to get real data, a set of random data is a good alternative. In this paper, a heuristic algorithm is proposed for generating sunflower random polygons using time.
منابع مشابه
Generating Random Polygons with Given Vertices
The problem of generating \random" geometric objects is motivated by the need to generate test instances for geometric algorithms. We examine the speciic problem of generating a random x-monotone polygon on a given set of n vertices. Here, \random" is taken to mean that we select uniformly at random a polygon, from among all those x-monotone polygons having the given n vertices. We give an algo...
متن کاملThree Heuristic Algorithms for Generation of Random
and computational geometry is the generation of random polygons. practical evaluation of algorithms that operate on polygons, where it is necessary to check determine the actual CPU experimentally. To this time, no polynomial known for the random generation of polygons with a uniform distribution presented for generating random polygons using a set of random vertices using
متن کاملGenerating random star-shaped polygons
In this paper we deal with two problems on star-shaped polygons. At rst, we present a Las-Vegas algorithm that uniformly at random creates a star-shaped polygon whose vertices are given by a point set S of n points in the plane that does not admit degenerated star-shaped polygons. The expected running time of the algorithm is O(n logn) and it uses O(n) memory. We call a starshaped polygon degen...
متن کاملGenerating Random Orthogonal Polygons
We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a technique we developed to obtain polygons with an increasing number of vertices starting from a unit square. The other follows a constraint programming approach and gives great control on the generated polygons. In particular, it...
متن کاملGenerating Random Star-shaped Polygons (extended Abstract)
In this paper we deal with two problems on star-shaped polygons. First, we present a Las-Vegas algorithm that uniformly at random creates a star-shaped polygon whose vertices are given by a point set S of n points in the plane that does not admit degenerate star-shaped polygons. The expected running time of the algorithm is O(n 2 logn) and it uses O(n) memory. We call a star-shaped polygon dege...
متن کامل