Longest-edge n-section algorithms: Properties and open problems

In this paper we survey all known (including own recent results) properties of the longest-edge n-section algorithms. These algorithms (in classical and recently designed conforming form) are nowadays used in many applications, including finite element simulations, computer graphics, etc. as a relia...

Full description

Saved in:
Bibliographic Details
Published inJournal of computational and applied mathematics Vol. 293; pp. 139 - 146
Main Authors Korotov, Sergey, Plaza, Ángel, Suárez, José P.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.02.2016
Subjects
Angle conditions
Finite element method
Longest-edge [formula omitted]-section algorithm
Mesh refinement
Mesh regularity
Simplicial partition
Finite element method
Mesh refinement
Angle conditions
Simplicial partition
65N50
65Y20
65M50
Longest-edge n-section algorithm
65N30
Mesh regularity
Online AccessGet full text
ISSN0377-0427
1879-1778
DOI10.1016/j.cam.2015.03.046

Cover

More Information
Summary:In this paper we survey all known (including own recent results) properties of the longest-edge n-section algorithms. These algorithms (in classical and recently designed conforming form) are nowadays used in many applications, including finite element simulations, computer graphics, etc. as a reliable tool for controllable mesh generation. In addition, we present a list of open problems arising in and around this topic.
ISSN:0377-0427
1879-1778
DOI:10.1016/j.cam.2015.03.046