Abstract
A heuristic ‘GRP_CH’ has been proposed to generate a random simple polygon from a given set of ‘n’ points in 2-Dimensional plane. The “2-Opt Move” heuristic with time complexity \(\mathcal{O}(n^4)\) is the best known (referred in [1]) among the existing heuristics to generate a simple polygon. The proposed heuristics, ‘GRP_CH’ first computes the convex hull of the point set and then generates a random simple polygon from that convex hull. The ‘GRP_CH’ heuristic takes \(\mathcal{O}(n^3)\) time which is less than that of “2-opt Move” heuristic. We have compared our results with “2-Opt Move” and it shows that the randomness behaviour of ‘GRP_CH’ heuristic is better than that of “2-Opt Move” heuristic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Auer, T., Held, M.: Heuristics for the Generation of Random Polygons. In: Proc. 8th Canadian Conference Computational Geometry, Ottawa, Canada, pp. 38–44. Carleton University Press (1996)
O’Rouke, J., Virmani, M.: Generating Random Polygons. Technical Report 011, CS Dept., Smith College, Northampton, MA 01063 (1991)
Epstein, P., Sack, J.: Generating triangulation at random. ACM Transaction on Modeling and Computer Simulation 4(3), 267–278 (1994)
Leeuwen, J.V., Schoone, A.A.: Untangling a travelling salesman tour in the plane. In: Muhlbacher, J.R. (ed.) Proc.: 7th Conference Graph-theoretic Concepts in Computer Science (WG 1981), pp. 87–98 (1982)
Zhu, C., Sundaram, G., Snoeyink, J., Mitchel, J.S.B.: Generating random polygons with given vertices. Comput. Geom. Theory and Application 6(5), 277–290 (1996)
Ghosh, S.K.: Visibility Algorithm in the plane. Cambridge University Press (2007)
Kreveld, M.V., Berg, M.D., Schwartskopf, O., Overmars, M.: Computational Geometry, Algorithm and Application. Springer (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sadhu, S., Hazarika, S., Jain, K.K., Basu, S., De, T. (2012). GRP_CH Heuristic for Generating Random Simple Polygon. In: Arumugam, S., Smyth, W.F. (eds) Combinatorial Algorithms. IWOCA 2012. Lecture Notes in Computer Science, vol 7643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35926-2_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-35926-2_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35925-5
Online ISBN: 978-3-642-35926-2
eBook Packages: Computer ScienceComputer Science (R0)