Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
|
Civil-Comp Proceedings
ISSN 1759-3433 CCP: 94
PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON ENGINEERING COMPUTATIONAL TECHNOLOGY Edited by:
Paper 55
On the Adaptive Smoothness Functional Optimization of Quadrilateral Meshes P. Iványi
Department of System and Software Engineering, Pollack Mihály Faculty of Engineering, University of Pécs, Hungary , "On the Adaptive Smoothness Functional Optimization of Quadrilateral Meshes", in , (Editors), "Proceedings of the Seventh International Conference on Engineering Computational Technology", Civil-Comp Press, Stirlingshire, UK, Paper 55, 2010. doi:10.4203/ccp.94.55
Keywords: mesh smoothing, untangling, three dimensional surface meshes.
Summary
Mesh generation algorithms are used to generate valid meshes, however
in some cases the mesh changes and the same
conditions should be ensured during the analysis.
To ensure that the mesh stays valid, mesh modification, smoothing or
optimization algorithms must be applied to the mesh.
The mesh optimization algorithm must be robust and should always produce a valid mesh. This paper focuses on the adaptive smoothness functional optimization method published by Tinoco-Ruiz and Barrera-Sanchez [1,2,3]. They were interested in meshes for finite difference schemes and for their requirement that the meshes must be "convex or unfolded". This method is a discrete variational approach where "a function of the inner points is designed and it is expected that its minimum be attained in a grid with good geometrical properties" [2]. This paper investigates and demonstrates how this method can be extended to unstructured quadrilateral meshes and for three dimensional surface meshes with quadrilateral elements. The paper introduces a new objective function for the three dimensional case and a new procedure to calculate this objective function. References
purchase the full-text of this paper (price £20)
go to the previous paper |
|