scientific article; zbMATH DE number 1143749

From MaRDI portal
Publication:4385944





An algorithm for the improvement of 3D tetrahedral meshes is presented. The objective is to remove tetrahedrons with too small or too large angles. In order to achieve this changes in the connectivity of the grid and a smoothing technique for the vertices of the grid are applied. This smoothing technique is formulated as a nonsmooth optimization problem and solved by an analogue of the steepest gradient method for smooth functions. Several numerical results are presented and discussed, among those also the combination of the optimization technique with Laplacian smoothing [cf. \textit{D. A. Field}, Commun. Appl. Numer. Methods 4, No. 6, 709--712 (1988; Zbl 0664.65107)].




Cited in
(99)


Describes a project that uses

Uses Software






This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385944)