Abstract
The dynamic mesh moving method based on Delaunay graph is non-iterative and therefore efficient. However, intersections occur occasionally among the background graph elements for complex geometries with large relative movements, especially for the large boundary rotations. It not only consumes more time but also deteriorates mesh quality to regenerate the graph and to relocate mesh points. In this work, a dynamic mesh generation method based on background grid morphing is proposed. By appending some assistant points in the initial graph, a new background graph in conjunction with a new mapping is generated. Then, the ball-vertex method with boundary improvement is employed to move the new graph which drives the moving of the object mesh. The examples demonstrate that the improved method have better ability of keeping the shape for the regions concerned and can improve the intersection problems even with large boundary rotations. In general, the method proposed shows better performance in mesh quality and efficiency.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Batina T (1990) Unsteady Euler airfoil solution using unstructured dynamic mesh. AIAA J 28(8):1381–1388
Robinson AB, Batina T, Yang HTY (1991) Aeroelastic analysis of wings using the Euler equations with a deforming mesh. J Aircr 28(11):781–788
Kleb WL, Batina T (1992) Temporal adaptive Euler/Navier—stokes algorithm involving unstructured dynamic meshes. IA-A J 30(8):1980–1985
Farhat C, Degand C, Koobus B et al (1998) Torsional springs for two-dimensional dynamic unstructured fluid meshes. Comput Methods Appl Mech Eng 163(1–4):231–245
LIU XQ, Qin N, Xia H (2006) Fast dynamic grid deformation based on delaunay graph mapping. Comput Phys 211(2):405–423
Bowyer A (1981) Computing Dirichlet tessellations. Comput J 24(2):162–166
Watson DF (1981) Computing the n-dimension-al Delaunay tessellation with application to Voronoi polytopes. Comput J 24(2):167–171
Devroye L, Mucke E, Zhu B (1998) A note on point location of Delaunay triangulation of random points. Algorithmica 22(4):477–482
Bottasso CL, Detomi D, Serra R (2005) The ball-vertex method: a new simple spring analogy method for unstructured dynamic meshes. Comput Methods Appl Mech Eng 194:4244–4264
Blom FJ (2000) Considerations on the spring analogy. Int J Numer Methods Fluids 32(6):647–668
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media B.V.
About this paper
Cite this paper
Lin, T., Guan, Z. (2012). Fast Dynamic Mesh Moving Based on Background Grid Morphing. In: He, X., Hua, E., Lin, Y., Liu, X. (eds) Computer, Informatics, Cybernetics and Applications. Lecture Notes in Electrical Engineering, vol 107. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-1839-5_36
Download citation
DOI: https://doi.org/10.1007/978-94-007-1839-5_36
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-1838-8
Online ISBN: 978-94-007-1839-5
eBook Packages: EngineeringEngineering (R0)