Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/56548
Title: Longest-edge n-section algorithms : properties and open problems
Authors: Korotov, Sergey
Plaza, Ángel 
Suárez, José P. 
UNESCO Clasification: 120601 Construcción de algoritmos
Keywords: Longest-edgen-section algorithm
Simplicial partition
Angle conditions
Finite element method
Mesh refinement, et al
Issue Date: 2016
Journal: Journal of Computational and Applied Mathematics 
Abstract: In this paper we survey all known (including own recent results) properties of the longest-edge nn-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.
URI: http://hdl.handle.net/10553/56548
ISSN: 0377-0427
DOI: 10.1016/j.cam.2015.03.046
Source: Journal of computational and applied mathematics [ISSN 0377-0427], v. 293 (1), p. 139-146
URL: http://dialnet.unirioja.es/servlet/articulo?codigo=5327883
Appears in Collections:Artículos
Show full item record

SCOPUSTM   
Citations

7
checked on Aug 7, 2022

WEB OF SCIENCETM
Citations

4
checked on Aug 7, 2022

Page view(s)

55
checked on May 28, 2022

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.