Abstract
The main motivation for generating random simple polygons is to produce test instances for geometric algorithms. In this paper three new algorithms are proposed to generate random simple polygons. A point set in a two dimensional plane is the input, and a simple polygon is the output of the problem. At first a new algorithm to convert any kind of simple polygonal chains into simple polygons is presented and the correctness of the algorithm is proved. Then three new algorithms are presented to produce random simple polygonal chains from the given point set. The first algorithm is capable of producing \(2^n\) simple polygonal chains. The second algorithm works by the concept of divide and conquer and the third algorithm is the most complete and produces all the possible simple polygonal chains. The worst time complexities of these three chain generation algorithms are \(O(n^2)\), \(O(n^2)\) and \(O(n^3)\) respectively and the time complexity of the conversion algorithm is O(n*l), where \(1<l<n\). The polygon generation algorithm works in this way that first each simple polygonal chain generation algorithms are applied over the point set and then the generated chains are converted to simple polygons. The number of different simple polygons generated by each of three algorithms is compared with the well-known algorithms and the experimental results show that the third algorithm produces more polygons rather than the well-known 2-opt move algorithm. The first algorithm acts better than the second algorithm, where both act better than steady Growth.
Similar content being viewed by others
References
Zhu, C., Sundaram, G., Snoeyink, J., Mitchel, J.S.B.: Generating random polygons with given vertices. Comput. Geom. Theory Appl. 6, 277–290 (1996)
Auer, T., Held, M.: Heuristics for the generation of random polygons. In: 8th Canadian conference of computational geometry, pp. 38–44 (1996)
Dailey, D., Whitfield, D.: Constructing random polygons. In: Proceedings of the 9th ACM SIGITE Conference on Information Technology Education, pp. 119–124. ACM (2008)
Christian, S.: Generating random star-shaped polygons. CCCG (1999)
Tahat, L. H., et al.: Requirement-based automated black-box test generation. In: Computer software and applications conference, 25th annual international. IEEE (2001)
Spillner, A., Linz, T., Schaefer, H.: Software Testing Foundations: A Study Guide for the Certified Tester Exam. Rocky Nook Inc, Santa Barbara (2014)
Hughes, J.F., Van Dam, A., Foley, J.D., Feiner, S.K.: Computer Graphics: Principles and Practice. Pearson Education, Upper Saddle River (2014)
Crespo, J., Barber, R., Victores, J.G., Jardon, A.: Algorithm for graph visibility obtainment from a map of non-convex polygons. Int. J. Mech. Eng. Robot. Res. 3(2), 150 (2014)
Valveny, E., Delalandre, M., Raveaux, R., Lamiroy, B.: Report on the Symbol Recognition and Spotting Contest. In: Kwon, Y.B., Ogier, J.M. (eds) Graphics Recognition. New Trends and Challenges. Lecture Notes in Computer Science, vol. 7423. Springer, Berlin, Heidelberg (2013)
Jha, M.K., McCall, C., Schonfeld, P.: Using GIS, genetic algorithms, and visualization in highway development. ComputerAided Civ. Infrastruct. Eng. 16(6), 399–414 (2001)
Epstein, P., Sack, J.: Generating triangulation at random. ACM Trans. Model. Comput. Simul. 4(3), 267–278 (1994)
O’Rourke, J., Virmani, M.: Generating random polygons. In: Technical report 011,CS Dept., Smith College, Northampton, MA 01063, 3844, (1991)
Leeuwen, J.V., Schoone, A.A.: Untangling a travelling salesman tour in the plane. In: 7th conference graph-theoretic concepts in computer science, pp. 87–98 (1982)
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer-Verlag TELOS, Santa Clara (2008)
Auer, T., Held, M.: RPG-heuristics for the generation of random polygons. In: Proceedings of the 8th Canada Conference on Computational Geometry, pp. 38–44. Ottawa, Canada (1996)
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Nourollah, A., Movahedinejad, M. Use of simple polygonal chains in generating random simple polygons. Japan J. Indust. Appl. Math. 34, 407–428 (2017). https://doi.org/10.1007/s13160-017-0258-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13160-017-0258-8