{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:59:58Z","timestamp":1761807598429},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222187"},{"type":"electronic","value":"9783540259459"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25945-9_36","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T11:44:04Z","timestamp":1280922244000},"page":"364-373","source":"Crossref","is-referenced-by-count":10,"title":["Generating Random Orthogonal Polygons"],"prefix":"10.1007","author":[{"given":"Ana Paula","family":"Tom\u00e1s","sequence":"first","affiliation":[]},{"given":"Ant\u00f3nio Leslie","family":"Bajuelos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s00454-002-2775-7","volume":"28","author":"O. Aichholzer","year":"2002","unstructured":"Aichholzer, O., Cort\u00e9s, C., Demaine, E.D., Dujmovic, V., Erickson, J., Meijer, H., Overmars, M., Palop, B., Ramaswawi, S., Toussaint, G.T.: Flipturning polygons. Discrete & Computational Geometry\u00a028, 231\u2013253 (2002)","journal-title":"Discrete & Computational Geometry"},{"key":"36_CR2","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1515\/9780773591134-009","volume-title":"Proc. of 8th Canadian Conf. Computational Geometry (CCCG 1996)","author":"T. Auer","year":"1996","unstructured":"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\u201344. Carleton University Press, Ottawa (1996)"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BFb0033845","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"M. Carlsson","year":"1997","unstructured":"Carlsson, M., Ottosson, G., Carlson, B.: An open-ended finite domain constraint solver. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol.\u00a01292, pp. 191\u2013206. Springer, Heidelberg (1997)"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"627","DOI":"10.2307\/2301373","volume":"42","author":"P. Erd\u00f6s","year":"1935","unstructured":"Erd\u00f6s, P.: Problem number 3763. American Mathematical Monthly\u00a042, 627 (1935)","journal-title":"American Mathematical Monthly"},{"key":"36_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-46135-3_28","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"I.P. Gent","year":"2002","unstructured":"Gent, I.P., Harvey, W., Kelsey, T.: Groups and constraints \u2013 symmetry breaking during search. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 415\u2013430. Springer, Heidelberg (2002)"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-46135-3_29","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"I. McDonald","year":"2002","unstructured":"McDonald, I., Smith, B.: Partial symmetry breaking. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 431\u2013445. Springer, Heidelberg (2002)"},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"648","DOI":"10.2307\/2319703","volume":"82","author":"G.H. Meisters","year":"1975","unstructured":"Meisters, G.H.: Polygons have ears. American Mathematical Monthly\u00a082, 648\u2013651 (1975)","journal-title":"American Mathematical Monthly"},{"key":"36_CR8","volume-title":"Art gallery theorems and algorithms","author":"J. O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art gallery theorems and algorithms. Oxford University Press, Oxford (1987)"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BF01918136","volume":"21","author":"J. O\u2019Rourke","year":"1983","unstructured":"O\u2019Rourke, J.: An alternate proof of the rectilinear art gallery theorem. J. of Geometry\u00a021, 118\u2013130 (1983)","journal-title":"J. of Geometry"},{"key":"36_CR10","unstructured":"O\u2019Rourke, J., Pashchenko, I., Tewari, G.: Partitioning orthogonal polygons into fat rectangles. In: Proc. 13th Canadian Conference on Computational Geometry (CCCG 2001), pp. 133\u2013136 (2001)"},{"key":"36_CR11","unstructured":"Sohler, C.: Generating random star-shaped polygons. In: Proc. 11th Canadian Conference on Computational Geometry (CCCG 1999), pp. 174\u2013177 (1999)"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"176","DOI":"10.2307\/2302483","volume":"46","author":"B. Sz-Nagy","year":"1939","unstructured":"Sz-Nagy, B.: Solution of problem 3763. American Mathematical Monthly\u00a046, 176\u2013177 (1939)","journal-title":"American Mathematical Monthly"},{"key":"36_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1007\/3-540-44860-8_90","volume-title":"Computational Science \u2013 ICCS 2003","author":"A.P. Tom\u00e1s","year":"2003","unstructured":"Tom\u00e1s, 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.\u00a02657, pp. 869\u2013878. Springer, Heidelberg (2003)"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.2307\/2324033","volume":"122","author":"G.T. Toussaint","year":"1991","unstructured":"Toussaint, G.T.: Polygons are anthropomorphic. American Mathematical Monthly\u00a0122, 31\u201335 (1991)","journal-title":"American Mathematical Monthly"},{"issue":"5","key":"36_CR15","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0925-7721(95)00031-3","volume":"6","author":"G. Zhu","year":"1996","unstructured":"Zhu, G., Sundaram, G., Snoeyink, J., Mitchell, J.: Generating random polygons with given vertices. Computational Geom. Theory and Appl.\u00a06(5), 277\u2013290 (1996)","journal-title":"Computational Geom. Theory and Appl."},{"key":"36_CR16","volume-title":"Handbook on Computational Geometry","author":"J. Urrutia","year":"2000","unstructured":"Urrutia, J.: Art gallery and illumination problems. In: Sack, J.-R., Urrutia, J. (eds.) Handbook on Computational Geometry, Elsevier, Amsterdam (2000)"}],"container-title":["Lecture Notes in Computer Science","Current Topics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25945-9_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T01:46:05Z","timestamp":1711676765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25945-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222187","9783540259459"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25945-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}