Ayuda
Ir al contenido

Dialnet


Longest-edge nn-section algorithms: properties and open problems

    1. [1] Universidad de Las Palmas de Gran Canaria

      Universidad de Las Palmas de Gran Canaria

      Gran Canaria, España

    2. [2] Bergen University College, Norway
  • Localización: Journal of computational and applied mathematics, ISSN 0377-0427, Vol. 293, Nº 1 (February 2016), 2016, págs. 139-146
  • Idioma: inglés
  • Enlaces
  • Resumen
    • 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.


Fundación Dialnet

Dialnet Plus

  • Más información sobre Dialnet Plus

Opciones de compartir

Opciones de entorno