Similarity Classes of the Longest-Edge Trisection of Triangles

Author:

Perdomo Francisco1ORCID,Plaza Ángel2ORCID

Affiliation:

1. IES Guanarteme, 35011 Las Palmas de Gran Canaria, Spain

2. Department of Mathematics, University of Las Palmas de Gran Canaria, 35017 Las Palmas de Gran Canaria, Spain

Abstract

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.

Publisher

MDPI AG

Subject

Geometry and Topology,Logic,Mathematical Physics,Algebra and Number Theory,Analysis

Reference19 articles.

1. Mesh generation/refinement using fractal concepts and iterated function systems;Bova;Internat. J. Numer. Meth. Engrg.,1992

2. Carey, G.F. (1997). Computational Grids: Generation, Refinement and Solution Strategies, Taylor and Francis.

3. On the equivalence of regularity criteria for triangular and tetrahedral finite element partitions;Brandts;Comput. Math. Appl.,2008

4. Mesh refinement based on the generalized bisection of simplices;Rivara;SIAM J. Numer. Anal.,1984

5. The 4-triangles longest-side partition of triangles and linear refinement algorithms;Rivara;Math. Compt.,1996

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3