Abstract
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 may be used to find all n-vertex orthogonal polygons with no collinear edges that can be drawn in an \(\frac{n}{2} \times \frac{n}{2}\) grid, for small n, with symmetries broken.
This work has been partially supported by funds granted to LIACC through Programa de Financiamento Plurianual, Fundaçã o para a Ciência e Tecnologia (FCT) and Programa POSI, and by R&D Unit “Mathematics and Applications” (Univ. of Aveiro) through Programa POCTI, FCT, co-financed by EC fund FEDER.
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
Aichholzer, O., Cortés, C., Demaine, E.D., Dujmovic, V., Erickson, J., Meijer, H., Overmars, M., Palop, B., Ramaswawi, S., Toussaint, G.T.: Flipturning polygons. Discrete & Computational Geometry 28, 231–253 (2002)
Auer, T., Held, M.: Heuristics for the generation of random polygons. In: Fiala, F., Kranakis, E., Sack, J.-R. (eds.) Proc. of 8th Canadian Conf. Computational Geometry (CCCG 1996), pp. 38–44. Carleton University Press, Ottawa (1996)
Carlsson, M., Ottosson, G., Carlson, B.: An open-ended finite domain constraint solver. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol. 1292, pp. 191–206. Springer, Heidelberg (1997)
Erdös, P.: Problem number 3763. American Mathematical Monthly 42, 627 (1935)
Gent, I.P., Harvey, W., Kelsey, T.: Groups and constraints – symmetry breaking during search. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 415–430. Springer, Heidelberg (2002)
McDonald, I., Smith, B.: Partial symmetry breaking. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 431–445. Springer, Heidelberg (2002)
Meisters, G.H.: Polygons have ears. American Mathematical Monthly 82, 648–651 (1975)
O’Rourke, J.: Art gallery theorems and algorithms. Oxford University Press, Oxford (1987)
O’Rourke, J.: An alternate proof of the rectilinear art gallery theorem. J. of Geometry 21, 118–130 (1983)
O’Rourke, J., Pashchenko, I., Tewari, G.: Partitioning orthogonal polygons into fat rectangles. In: Proc. 13th Canadian Conference on Computational Geometry (CCCG 2001), pp. 133–136 (2001)
Sohler, C.: Generating random star-shaped polygons. In: Proc. 11th Canadian Conference on Computational Geometry (CCCG 1999), pp. 174–177 (1999)
Sz-Nagy, B.: Solution of problem 3763. American Mathematical Monthly 46, 176–177 (1939)
Tomás, A.P., Bajuelos, A.L., Marques, F.: Approximation algorithms to minimum vertex cover problems on polygons and terrains. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2657, pp. 869–878. Springer, Heidelberg (2003)
Toussaint, G.T.: Polygons are anthropomorphic. American Mathematical Monthly 122, 31–35 (1991)
Zhu, G., Sundaram, G., Snoeyink, J., Mitchell, J.: Generating random polygons with given vertices. Computational Geom. Theory and Appl. 6(5), 277–290 (1996)
Urrutia, J.: Art gallery and illumination problems. In: Sack, J.-R., Urrutia, J. (eds.) Handbook on Computational Geometry, Elsevier, Amsterdam (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tomás, A.P., Bajuelos, A.L. (2004). Generating Random Orthogonal Polygons. In: Conejo, R., Urretavizcaya, M., Pérez-de-la-Cruz, JL. (eds) Current Topics in Artificial Intelligence. TTIA 2003. Lecture Notes in Computer Science(), vol 3040. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25945-9_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-25945-9_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22218-7
Online ISBN: 978-3-540-25945-9
eBook Packages: Springer Book Archive