On the maximum angle condition for the conforming longest-edge n-section algorithm for large values of n

In this note we introduce the conforming longest-edge n-section algorithm and show that for n≥4 it produces a family of triangulations which does not satisfy the maximum angle condition.

Saved in:
Bibliographic Details
Published inComputer aided geometric design Vol. 32; pp. 69 - 73
Main Authors Korotov, Sergey, Plaza, Ángel, Suárez, José P.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.01.2015
Subjects
Algorithms
Angles (geometry)
Computer aided design
Conforming longest-edge n-section
Finite element method
Maximum angle condition
Mesh refinement
Minimum angle condition
Triangulation
Finite element method
Mesh refinement
Conforming longest-edge n-section
Maximum angle condition
Minimum angle condition
Online AccessGet full text
ISSN0167-8396
1879-2332
1879-2332
DOI10.1016/j.cagd.2014.12.001

Cover

More Information
Summary:In this note we introduce the conforming longest-edge n-section algorithm and show that for n≥4 it produces a family of triangulations which does not satisfy the maximum angle condition.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0167-8396
1879-2332
1879-2332
DOI:10.1016/j.cagd.2014.12.001