Abstract
Problems dealing with the generation of random polygons has important applications for evaluating the performance of algorithms on polygonal domain. We review existing algorithms for generating random polygons. We present an algorithm for generating polygons admitting visibility properties. In particular, we propose an algorithm for generating random polygons admitting large size kernels.
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
Similar content being viewed by others
References
Auer, T., Held, M.: RPG – heuristics for the generation of random polygons. In: Proceedings of 8th Canadian Conference on Computational Geometry, pp. 38–44 (1998)
Asano, T.: An efficient algorithm for finding the visibility polygons for a polygonal region with holes. Trans. IECE Jpn. E-68, 557–559 (1985)
Barber, C.B., Dobkin, D.P., Huhdanpaa, H.: The quick hull algorithm for convex hulls. ACM Trans. Math. Softw. 22, 469–483 (1996)
ElGindy, H.A., Avis, D.: A linear algorithm for computing the visibility polygon from a point. J. Algorithms 2(1981), 186–197 (1981)
Finkel, R.A., Bently, J.L.: Quad trees, a data structure for retrieval on composite keys. Acta Informatica 4(1), 1–9 (1974)
Gewali, L.P.: Recognizing s-star polygons. Pattern Recogn. 28(7), 1019–1032 (1995)
Lee, D.: Visibility of a simple polygon. Comput. Vis. Graph. Image Process. 22, 207–221 (1983)
Lehn, J.: Pseudorandom number generators. Oper. Res. 91, 9–13 (1992)
Lee, D.T., Preparata, F.P.: An optimal algorithm for finding the kernel of a polygon. J. ACM (JACM) 26, 415–421 (1979)
O’Rourke, J.: Art Gallery Theorems and Algorithms, vol. 57. Oxford University Press, Oxford (1987)
Sohler, C.: Generating random star-shaped polygons. In: Proceedings of 8th Canadian Conference on Computational Geometry, pp. 174–179 (1999)
Vassilev, T.S.: Visibility: finding the staircase kernel in orthogonal polygons (2015)
Zhu, C., Sundaram, G., Snoeyink, J., Mitchell, J.S.: Generating random polygons with given vertices. Comput. Geometry 6(5), 277–290 (1996)
Chazelle, B.: On the convex layers of convex set. IEEE Trans. Inf. Theory IT-31(4), 509–517 (1985)
Subedi, B.: Generating kernel aware polygons. MS thesis, Department of Computer Science, University of Nevada, Las Vegas (2019)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Gewali, L., Subedi, B. (2021). Random Generation of Visibility Aware Polygons. In: Selvaraj, H., Chmaj, G., Zydek, D. (eds) Proceedings of the 27th International Conference on Systems Engineering, ICSEng 2020. ICSEng 2020. Lecture Notes in Networks and Systems, vol 182. Springer, Cham. https://doi.org/10.1007/978-3-030-65796-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-65796-3_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-65795-6
Online ISBN: 978-3-030-65796-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)