Boundary treatment for 2D elliptic mesh generation in complex geometries

Zhang, Yaoxin; Jia, Yafei; Wang, Sam S. Y.; Chan, Hsun-Chuan

doi:10.1016/j.jcp.2008.05.008

Cited by 7 publications

(15 citation statements)

References 9 publications

(21 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nonetheless, these algorithms are either complicated in nature or require multiple transformations between coordinate systems, which leads to arduous implementations. In some schemes, the new mesh cannot be generated after rounds of iterations, which may degrade the scheme efficiency [6,8,9]. Thus, in this paper, we propose an efficient and simple algorithm for mesh regeneration to ensure that most FEM triangle elements are of nice shapes throughout a twodimensional ALE simulation of incompressible flows with moving solid boundary.…”

Section: Introductionmentioning

confidence: 99%

A novel mesh regeneration algorithm for 2D FEM simulations of flows with moving boundary

Yang

Chen

Young

2011

Journal of Computational Physics

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

A novel mesh regeneration algorithm for 2D FEM simulations of flows with moving boundary

Yang

Chen

Young

2011

Journal of Computational Physics

View full text Add to dashboard Cite

“…An assembled algebraic mesh of both domains A and B and its smoothing version using an elliptic mesh generation system (Zhang et al, 2008) is shown in Fig. 8b and Fig.…”

Section: Block Mesh Generation and Assemblingmentioning

confidence: 99%

Composite Structured Mesh Generation With Automatic Domain Decomposition In Complex Geometries

Zhang

Jia

Wang

et al. 2013

Engineering Applications of Computational Fluid Mechanics

Self Cite

View full text Add to dashboard Cite

This paper presents a novel automatic domain decomposition method to generate quality composite structured meshes in complex domains with arbitrary shapes, in which quality structured mesh generation still remains a challenge. The proposed decomposition algorithm is based on the analysis of an initial Delaunay triangulation on the closed boundary of the computational domain. The virtual edges with the so-called shortest effective length of the effective concave points are identified as candidates of the interface line between neighboring blocks. As demonstrated by examples and application, the proposed algorithm is capable of effectively decomposing complex domains without holes or islands (inner boundaries) into simpler patched blocks and thus significantly alleviated the difficulties of structured mesh generation in those domains.

show abstract

“…Eqs. (15) and (17) in two and three dimensional cases, respectively. It is found that the use of Eq.…”

Section: ð35-mþmentioning

confidence: 99%

“…Its intrinsic drawback of mesh smoothness lack of control was addressed by Zhang et al [14] who proposed a method to control the distortion function (that describes the mesh density or mesh aspect ratio distribution) of the orthogonal mesh generation system imposing the orthogonality in both the interior and boundary regions. Recently, Zhang et al [15] further improved the method to treat boundary orthogonality in complex geometries with a two-dimensional elliptic orthogonal mesh generation system by using sliding boundary points with the aid of additional auxiliary mesh lines. However, this method is inherently inextensible to adaptive moving mesh generation.…”

Section: Introductionmentioning

confidence: 99%