A new mesh generation scheme for arbitrary planar domains

Abstract

SUMMARYThis paper describes a new algorithm to generate interior nodes within any arbitrary multi-connected regions. The boundary nodes and the interior nodes are then linked up to form the best possible triangular elements by a completely revised technique in an efficient and stable manner. Owing to the generality of the central generation program, the global domain is allowed to be divided into as many irregular subdomains as desired, in order to model closely the actual physical situation. Moreover, the boundaries of the subdomains are updated from time to time when necessary to include the possibilities of progressive refinement around a sharp corner, generating radiating mesh from a prescribed node, generating mesh between two circular arcs, etc. Despite its flexibility and capabilities, data for triangulation have been kept to a minimum by a logical input module; no connectivity information between subregions is needed, and common boundaries are defined once only. All these features have contributed to a powerful method to generate 3-node or 6-node triangular element meshes of great variety within the most irregular heterogeneous regions.

A fast algorithm for simulating vesicle flows in three dimensions

“…An advancing-front method for remeshing of quadratic triangular elements (originally proposed in [39]) adapting triangle size to local criteria such as curvature is described in [36] and is extended in a number subsequent papers to surfaces, in particular in Lohner [42]. Tryggvason et al [60] briefly describe an algorithm for adapting a mesh to an evolving fluid interface, which uses edge length as a criterion for bisection and edge collapses to remove small elements.…”

“…In the context of vesicle simulations at the end of each time step, we perform reparametrization to improve the quality of the surface representation, using the scheme (37) with the quality measure E given by (39). Since the objective of reparametrization is to maximize the decay of spherical harmonic coefficients, we choose n 0 in Equation (39) to be p/3 where p is the order of truncated spherical harmonics series of the surface.…”

“…projected gradient y + ← y + ∆τ g y ← y + end while ∇E is given by (39). Notice, that in our implementation we use upsampling (by a factor of two).…”

The Research on Tetrahedral Mesh Optimization Algorithm of the Double Channel Pump

“…This technique generally quite suits for meshes in convex regions. However, the single Laplacian smoothing could result in inverted elements near concavities in the model, it is always used combining other mesh optimization algorithms [9,10,11].…”

Order of accuracy study of unstructured grid finite volume upwind schemes

“…and −45 deg. with respect to the x axis or a "truly" unstructured grid (Lo, 1985), in which the orientation of the diagonals is somewhat random. Examples of the possible grid types are shown in Fig.…”