Convex Polygon Triangulation Based on Symmetry : научное издание

Описание

Тип публикации: статья из журнала

Год издания: 2023

Идентификатор DOI: 10.3390/sym15081526

Аннотация: <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 δi,n and diagonal δn−i,n, i∈{2,…,⌊n/2⌋} results in mirror images. Obviously, there are ⌊n/2⌋−1 pairs of these reflectively symmetrical images. The influence of the observed symmetry on polyПоказать полностьюgon 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>

Ссылки на полный текст

Издание

Журнал: Symmetry

Выпуск журнала: Т.15, 8

Номера страниц: 1526

ISSN журнала: 20738994

Персоны

  • Krtolica Predrag V. (Faculty of Sciences and Mathematics, University of Niš, Višegradska 33, 18000 Niš, Serbia)
  • Stanimirović Predrag S. (Laboratory “Hybrid Methods of Modelling and Optimization in Complex Systems”, Siberian Federal University, Prosp. Svobodny 79, 660041 Krasnoyarsk, Russia)
  • Mašović Sead H. (Faculty of Sciences and Mathematics, University of Niš, Višegradska 33, 18000 Niš, Serbia)
  • Elshaarawy Islam A. (Faculty of Engineering (at Shoubra), Benha University, Cairo 11672, Egypt)
  • Stupina Alena (Laboratory “Hybrid Methods of Modelling and Optimization in Complex Systems”, Siberian Federal University, Prosp. Svobodny 79, 660041 Krasnoyarsk, Russia)

Вхождение в базы данных