{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T04:56:28Z","timestamp":1778561788982,"version":"3.51.4"},"reference-count":21,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T00:00:00Z","timestamp":1690934400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Science and Higher Education of the Russian Federation","award":["075-15-2022-1121"],"award-info":[{"award-number":["075-15-2022-1121"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>A polygon with n nodes can be divided into two subpolygons by an internal diagonal through node n. Splitting the polygon along diagonal \u03b4i,n and diagonal \u03b4n\u2212i,n, i\u2208{2,\u2026,\u230an\/2\u230b} results in mirror images. Obviously, there are \u230an\/2\u230b\u22121 pairs of these reflectively symmetrical images. The influence of the observed symmetry on polygon triangulation is studied. The central result of this research is the construction of an efficient algorithm used for generating convex polygon triangulations in minimal time and without generating repeat triangulations. The proposed algorithm uses the diagonal values of the Catalan triangle to avoid duplicate triangulations with negligible computational costs and provides significant speedups compared to known methods.<\/jats:p>","DOI":"10.3390\/sym15081526","type":"journal-article","created":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T11:04:38Z","timestamp":1690974278000},"page":"1526","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Convex Polygon Triangulation Based on Symmetry"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4505-063X","authenticated-orcid":false,"given":"Predrag V.","family":"Krtolica","sequence":"first","affiliation":[{"name":"Faculty of Sciences and Mathematics, University of Ni\u0161, Vi\u0161egradska 33, 18000 Ni\u0161, Serbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0655-3741","authenticated-orcid":false,"given":"Predrag S.","family":"Stanimirovi\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Sciences and Mathematics, University of Ni\u0161, Vi\u0161egradska 33, 18000 Ni\u0161, Serbia"},{"name":"Laboratory \u201cHybrid Methods of Modelling and Optimization in Complex Systems\u201d, Siberian Federal University, Prosp. Svobodny 79, 660041 Krasnoyarsk, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1728-2775","authenticated-orcid":false,"given":"Sead H.","family":"Ma\u0161ovi\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Sciences and Mathematics, University of Ni\u0161, Vi\u0161egradska 33, 18000 Ni\u0161, Serbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8144-0256","authenticated-orcid":false,"given":"Islam A.","family":"Elshaarawy","sequence":"additional","affiliation":[{"name":"Faculty of Engineering (at Shoubra), Benha University, Cairo 11672, Egypt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5564-9267","authenticated-orcid":false,"given":"Alena","family":"Stupina","sequence":"additional","affiliation":[{"name":"Laboratory \u201cHybrid Methods of Modelling and Optimization in Complex Systems\u201d, Siberian Federal University, Prosp. Svobodny 79, 660041 Krasnoyarsk, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,8,2]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Stanley, R.P. (1999). Enumerative Combinatorics, Cambridge University Press.","DOI":"10.1017\/CBO9780511609589"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Koshy, T., and Zheng, B. (2009). Catalan Numbers with Applications, Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780195334548.001.0001"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1080\/0025570X.1996.11996408","article-title":"Counting Arrangements of 1\u2019s and -1\u2019s","volume":"69","author":"Bailey","year":"1996","journal-title":"Math. Mag."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0012-365X(76)90009-1","article-title":"A Catalan triangle","volume":"14","author":"Shapiro","year":"1976","journal-title":"Discret. Math."},{"key":"ref_5","unstructured":"Boltyanski, V., Martini, H., and Soltan, P.S. (2012). Excursions into Combinatorial Geometry, Springer Science & Business Media."},{"key":"ref_6","first-page":"344","article-title":"Block Method for Convex Polygon Triangulation","volume":"15","author":"Krtolica","year":"2012","journal-title":"ROMJIST"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0925-7721(99)00016-4","article-title":"Graph of triangulations of a convex polygon and tree of triangulations","volume":"13","author":"Hurtado","year":"1999","journal-title":"Comput. Geom."},{"key":"ref_8","first-page":"189","article-title":"Triangulation of convex polygon with storage support","volume":"29","author":"Krtolica","year":"2014","journal-title":"Facta Univ. Ser. Math. Inform."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"346","DOI":"10.3906\/elk-1805-143","article-title":"Convex polygon triangulation based on planted trivalent binary tree and ballot problem","volume":"27","author":"Saracevic","year":"2019","journal-title":"Turk. J. Electr. Eng. Comput. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/PL00009444","article-title":"Properties of random triangulations and trees","volume":"22","author":"Devroye","year":"1999","journal-title":"Discret. Comput. Geom."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.aam.2014.01.004","article-title":"Counting symmetry classes of dissections of a convex regular polygon","volume":"56","author":"Bowman","year":"2014","journal-title":"Adv. Appl. Math."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"335","DOI":"10.55630\/sjc.2010.4.335-348","article-title":"Quadratic time computable instances of maxmin and minmax area triangulations of convex polygons","volume":"4","author":"Mirzoev","year":"2010","journal-title":"Serdica J. Comput."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"439","DOI":"10.2298\/AADM170829013M","article-title":"Orbiting Triangle Method for convex polygon triangulation","volume":"12","author":"Elshaarawy","year":"2018","journal-title":"Appl. Anal. Discret. Math."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0898-1221(94)90152-X","article-title":"Geometric classification of triangulations and their enumeration in a convex polygon","volume":"27","author":"Mukhopadhyaya","year":"1994","journal-title":"Comput. Math. Appl."},{"key":"ref_15","first-page":"1","article-title":"Triangulations with few ears: Symmetry classes and disjointness","volume":"16","author":"Asinowski","year":"2016","journal-title":"Integers"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"175","DOI":"10.4153\/CMB-1963-017-0","article-title":"Triangular dissections of n-gons","volume":"6","author":"Moon","year":"1963","journal-title":"Can. Math. Bull."},{"key":"ref_17","unstructured":"Regev, A. (2012). Enumerating triangulations by parallel diagonals. arXiv."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Bingane, C. (2022). Tight bounds on the maximal area of small polygons: Improved Mossinghoff polygons. arXiv.","DOI":"10.1007\/s00454-022-00374-z"},{"key":"ref_19","unstructured":"Pournine, L. (2014). The asymptotic diameter of cyclohedra. arXiv."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.ejc.2016.12.002","article-title":"Counting triangulations of subdivided convex polygons","volume":"62","author":"Asinowski","year":"2017","journal-title":"Eur. J. Comb."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Bishop, C.J. (2023). Uniformly Acute Triangulations of Polygons. Discret. Comput. Geom.","DOI":"10.1007\/s00454-023-00525-w"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/15\/8\/1526\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:24:21Z","timestamp":1760127861000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/15\/8\/1526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,2]]},"references-count":21,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2023,8]]}},"alternative-id":["sym15081526"],"URL":"https:\/\/doi.org\/10.3390\/sym15081526","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,2]]}}}