Similarity Classes of the Longest-Edge Trisection of Triangles

被引:0
|
作者
Perdomo, Francisco [1 ]
Plaza, Angel [2 ]
机构
[1] IES Guanarteme, Las Palmas Gran Canaria 35011, Spain
[2] Univ Las Palmas Gran Canaria, Dept Math, Las Palmas Gran Canaria 35017, Spain
关键词
longest-edge partition; trisection; triangulation; BISECTION METHOD;
D O I
10.3390/axioms12100913
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper studies the triangle similarity classes obtained by iterative application of the longest-edge trisection of triangles. The longest-edge trisection (3T-LE) of a triangle is obtained by joining the two points which divide the longest edge in three equal parts with the opposite vertex. This partition, as well as the longest-edge bisection (2T-LE), does not degenerate, which means that there is a positive lower bound to the minimum angle generated. However, unlike what happens with the 2T-LE, the number of similarity classes appearing by the iterative application of the 3T-LE to a single initial triangle is not finite in general. There are only three exceptions to this fact: the right triangle with its sides in the ratio 1:2:3 and the other two triangles in its orbit. This result, although of a combinatorial nature, is proved here with the machinery of discrete dynamics in a triangle shape space with hyperbolic metric. It is also shown that for a point with an infinite orbit, infinite points of the orbit are in three circles with centers at the points with finite orbits.
引用
收藏
页数:12
相关论文
共 50 条
  • [41] Similarity Classes of Tetrahedra
    Gonzalez, Ahtziri
    Lopez-Lopez, Jorge L.
    [J]. COMPUTATIONAL METHODS AND FUNCTION THEORY, 2022, 22 (02) : 243 - 260
  • [42] Similarity Classes of Tetrahedra
    Ahtziri González
    Jorge L. López-López
    [J]. Computational Methods and Function Theory, 2022, 22 : 243 - 260
  • [43] Commutation classes of the reduced words for the longest element of Gn
    Gutierres, Goncalo
    Mamede, Ricardo
    Santos, Jose Luis
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2020, 27 (02): : 1 - 25
  • [44] Many Empty Triangles have a Common Edge
    Barany, Imre
    Marckert, Jean-Francois
    Reitzner, Matthias
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2013, 50 (01) : 244 - 252
  • [45] Covering Triangles in Edge-Weighted Graphs
    Xujin Chen
    Zhuo Diao
    Xiaodong Hu
    Zhongzheng Tang
    [J]. Theory of Computing Systems, 2018, 62 : 1525 - 1552
  • [46] Many Empty Triangles have a Common Edge
    Imre Bárány
    Jean-François Marckert
    Matthias Reitzner
    [J]. Discrete & Computational Geometry, 2013, 50 : 244 - 252
  • [47] Longest edge routing on the spatial Aloha graph
    Weber, Steven
    Jindal, Nihar
    Ganti, Radha Krishna
    Haenggi, Martin
    [J]. GLOBECOM 2008 - 2008 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2008,
  • [48] Rainbow triangles in edge-colored graphs
    Li, Binlong
    Ning, Bo
    Xu, Chuandong
    Zhang, Shenggui
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2014, 36 : 453 - 459
  • [49] Covering Triangles in Edge-Weighted Graphs
    Chen, Xujin
    Diao, Zhuo
    Hu, Xiaodong
    Tang, Zhongzheng
    [J]. THEORY OF COMPUTING SYSTEMS, 2018, 62 (06) : 1525 - 1552
  • [50] Edge-disjoint rainbow triangles in edge-colored graphs
    Li, Luyi
    Li, Xueliang
    [J]. DISCRETE APPLIED MATHEMATICS, 2022, 318 : 21 - 30