Author:
Perdomo Francisco,Plaza Ángel
Abstract
AbstractThe Longest-Edge (LE) bisection of a triangle is obtained by joining the midpoint of its longest edge with the opposite vertex. Here two properties of the longest-edge bisection scheme for triangles are proved. For any triangle, the number of distinct triangles (up to similarity) generated by longest-edge bisection is finite. In addition, if LE-bisection is iteratively applied to an initial triangle, then minimum angle of the resulting triangles is greater or equal than a half of the minimum angle of the initial angle. The novelty of the proofs is the use of an hyperbolic metric in a shape space for triangles.
Reference28 articles.
1. Adler A., On the bisection method for triangles, Math. Comp., 1983, 40, 571–574
2. Babuška I., Aziz A. K., On the angle condition in the finite element method. SIAM J. Numer. Anal. 1976, 13, 214–226
3. Bern M., Eppstein D., Optimal Möbius transformations for information visualization and meshing, Lecture Notes in Comp. Sci., 2001, 2125, 14–25
4. Bookstein F.L., Morphometric Tools for Landmark Data: Geometry and Biology, Cambridge University Press, 1991
5. Brandts J., Korotov S., KříŽek M., On the equivalence of regularity criteria for triangular and tetrahedral finite element partitions, Comput. & Math. Appl., 2008, 55, 2227–2233
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献