1976
DOI: 10.1061/jmcea3.0002158
|View full text |Cite
|
Sign up to set email alerts
|

Laplacian-Isoparametric Grid Generation Scheme

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
20
0
1

Year Published

1997
1997
2020
2020

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 164 publications
(22 citation statements)
references
References 0 publications
1
20
0
1
Order By: Relevance
“…In order to avoid nonphysical solutions from the ionospheric solver due to large gradients (spikiness) in the conductance values, a smoothing filter was applied on the coefficients. The filter was based on a Laplacian mesh smoothing algorithm (e.g., Herrmann, 1976), commonly used in image processing (Yagou et al, 2002) and mesh refinement (Sorkine et al, 2004). The filter is applied such that at each node i,…”
Section: Cmeementioning
confidence: 99%
“…In order to avoid nonphysical solutions from the ionospheric solver due to large gradients (spikiness) in the conductance values, a smoothing filter was applied on the coefficients. The filter was based on a Laplacian mesh smoothing algorithm (e.g., Herrmann, 1976), commonly used in image processing (Yagou et al, 2002) and mesh refinement (Sorkine et al, 2004). The filter is applied such that at each node i,…”
Section: Cmeementioning
confidence: 99%
“…After the point mesh generation steps are completed, the domain will be covered by points with node spacing compatible with the user specifications. Just similar to the automatic mesh generation, it is found that the grading of the final the mesh can be improved by applying a Laplacian smoothing [26] procedure to the point mesh. However, for a point mesh, no fix connectivity relationship exists among the interior nodes.…”
Section: Point Mesh Quality Measurement and Enhancementmentioning
confidence: 99%
“…In order to improve the general shape of the mesh elements, an iterative Laplacian smoothing procedure based on Herrmann [9] is applied in which the position of each internal node is defined to be an average of that of its contiguous neighbours, being the ones connected to the given node by a single element segment: (1) where i ranges over all nodes, j ranges from 1 to K i , the number of nodes contiguous to the ith node, and n is the iteration counter. Convergence is evaluated according to: (2) where M is the total number of nodes and δ is a small value (0.001).…”
Section: Mesh Smoothingmentioning
confidence: 99%