Robust untangling of curvilinear meshes

This paper presents a technique that allows to untangle high-order/curvilinear meshes. The technique makes use of unconstrained optimization where element Jacobians are constrained to lie in a prescribed range through moving log-barriers. The untangling procedure starts from a possibly invalid curvilinear mesh and moves mesh vertices with the objective of producing elements that all have bounded Jacobians. Bounds on Jacobians are computed using the results of Johnen et al. (2012, 2013) [1] and [2]. The technique is applicable to any kind of polynomial element, for surface, volume, hybrid or boundary layer meshes. A series of examples demonstrate both the robustness and the efficiency of the technique. The final example, involving a time explicit computation, shows that it is possible to control the stable time step of the computation for curvilinear meshes through an alternative element deformation measure.