2010
DOI: 10.1002/nme.2900
|View full text |Cite
|
Sign up to set email alerts
|

A new fast hybrid adaptive grid generation technique for arbitrary two‐dimensional domains

Abstract: SUMMARYThis paper describes a new fast hybrid adaptive grid generation technique for arbitrary twodimensional domains. This technique is based on a Cartesian background grid with square elements and quadtree decomposition. A new algorithm is introduced for the distribution of boundary points based on the curvature of the domain boundaries. The quadtree decomposition is governed either by the distribution of the boundary points or by a size function when a solution-based adaptive grid is desired. The resulting … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
10
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 17 publications
(10 citation statements)
references
References 28 publications
0
10
0
Order By: Relevance
“…Zhang et al [5] Quad/Tri/Cartesian Advancing front method 2D Wang et al [6] Hexa/Tetra Advancing front method 3D Khawaja et al [10,11] Prism/Tetra Automatic receding 3D C advancing front method Dawes et al [8,9] Hexa/Cartesian Level set method 3D Gloth et al [12] Quad/Tri/Cartesian Level set method 2D Pattinson et al [13] Cartesian Cut-cell, dual-mesh 2D Ebeida et al [3] Quad/Tri Spatial decomposition We assume that the input object is given as a piecewise linear representation, such as the point sequence curves in 2D and triangular meshes in 3D. Let B = { 1 .…”
Section: Groupmentioning
confidence: 99%
See 2 more Smart Citations
“…Zhang et al [5] Quad/Tri/Cartesian Advancing front method 2D Wang et al [6] Hexa/Tetra Advancing front method 3D Khawaja et al [10,11] Prism/Tetra Automatic receding 3D C advancing front method Dawes et al [8,9] Hexa/Cartesian Level set method 3D Gloth et al [12] Quad/Tri/Cartesian Level set method 2D Pattinson et al [13] Cartesian Cut-cell, dual-mesh 2D Ebeida et al [3] Quad/Tri Spatial decomposition We assume that the input object is given as a piecewise linear representation, such as the point sequence curves in 2D and triangular meshes in 3D. Let B = { 1 .…”
Section: Groupmentioning
confidence: 99%
“…The level set [14,15] is the mathematical model, which describes the behavior of fronting boundaries varied by time. Given an interface .t/ in R n (n=2, 3) bounding an open region .t / and moving along time t , let an implicit functionˆ.p, t/ have the signed distance from p to .t/, and 895 the plus sign is chosen if p is outside .t /. Given an interface .t/ in R n (n=2, 3) bounding an open region .t / and moving along time t , let an implicit functionˆ.p, t/ have the signed distance from p to .t/, and 895 the plus sign is chosen if p is outside .t /.…”
Section: Body-fitted Layer Generationmentioning
confidence: 99%
See 1 more Smart Citation
“…Three typical approaches are briefly discussed here. The first approach is to subdivide the higher level quadtree cells next to a hanging node into smaller triangular and quadrilateral elements to enforce compatibility . Additional nodes may be added to improve the mesh quality and/or reduce the number of element types.…”
Section: Introductionmentioning
confidence: 99%
“…The first approach is to subdivide the higher level quadtree cells next to a hanging node into smaller triangular and quadrilateral elements to enforce compatibility. [16][17][18] Additional nodes may be added to improve the mesh quality and/or reduce the number of element types. The second approach is to create special conforming shape functions for cells with hanging nodes to ensure the displacement compatibility.…”
mentioning
confidence: 99%