Optimization-based smoothing algorithm for triangle meshes over arbitrarily shaped domains
Numerical Analysis
2014-10-23 v1 Numerical Analysis
Abstract
This paper describes a node relocation algorithm based on nonlinear optimization which delivers excellent results for both unstructured and structured plane triangle meshes over convex as well as non-convex domains with high curvature. The local optimization scheme is a damped Newton's method in which the gradient and Hessian of the objective function are evaluated exactly. The algorithm has been developed in order to continuously rezone the mesh in arbitrary Lagrangian-Eulerian (ALE) methods for large deformation penetration problems, but it is also suitable for initial mesh improvement. Numerical examples highlight the capabilities of the algorithm.
Cite
@article{arxiv.1410.5977,
title = {Optimization-based smoothing algorithm for triangle meshes over arbitrarily shaped domains},
author = {Daniel Aubram},
journal= {arXiv preprint arXiv:1410.5977},
year = {2014}
}
Comments
27 pages, 4 figures