Properties of the longest-edge n-section refinement scheme for triangular meshes

被引：6

作者：

Suarez, Jose P. ^{[1
]}

MorenoB, Tania ^{[2
]}

Abad, Pilar

Plaza, Angel

机构：

[1] Univ Las Palmas Gran Canaria, Escuela Ingn Ind & Civiles, Div Math Graph & Computat MAGiC, IUMA, Las Palmas Gran Canaria 35017, Canary Isl, Spain

[2] Univ Holguin, Fac Math & Informat, Holguin, Cuba

来源：

APPLIED MATHEMATICS LETTERS | 2012年 / 25卷 / 12期

关键词：

Longest-edge; Triangle partition; Triangle n-section;

D O I：

10.1016/j.aml.2012.04.014

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We prove that the longest-edge n-section of triangles for n >= 4 produces a sequence of triangle meshes with minimum interior angle converging to zero. The so called degeneracy property of LE for n >= 4 is proved. (c) 2012 Elsevier Ltd. All rights reserved.

引用

页码：2037 / 2039

页数：3

共 22 条

[21] On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular n-Simplex
Aparicio, Guillermo
Casado, Leocadio G.
Hendrix, Eligius M. T.
Toth, Boglarka G. -
Garcia, Inmaculada
[J]. INFORMATICA, 2015, 26 (01) : 17 - 32
[22] Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex
Aparicio, Guillermo
Casado, Leocadio G.
G-Toth, Boglarka
Hendrix, Eligius M. T.
Garcia, Inmaculada
[J]. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2014, PT II, 2014, 8580 : 115 - +

← 1 2 3 →