2005
DOI: 10.1142/9781860946813
|View full text |Cite
|
Sign up to set email alerts
|

Mesh Enhancement - Selected Elliptic Methods, Foundations and Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0
1

Year Published

2007
2007
2015
2015

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 18 publications
(21 citation statements)
references
References 0 publications
0
20
0
1
Order By: Relevance
“…In earlier variational grid generation approaches, suitable user-specified weights were needed to ensure grid quality. While, in principle, grid quality should be considered in connection to a given physical problem of interest [55], there are case studies in the literature which are so ill-posed that they produce poor-quality grids for most applications and mesh generators of interest. (See e.g.…”
Section: Discussionmentioning
confidence: 99%
“…In earlier variational grid generation approaches, suitable user-specified weights were needed to ensure grid quality. While, in principle, grid quality should be considered in connection to a given physical problem of interest [55], there are case studies in the literature which are so ill-posed that they produce poor-quality grids for most applications and mesh generators of interest. (See e.g.…”
Section: Discussionmentioning
confidence: 99%
“…When the models are reconstructed with the MC algorithm, triangle or mesh smoothing methods can be used to smooth the surface models. The Laplacian smoothing algorithm [29], which is an iterative algorithm, was used to smooth the triangle surfaces. The principle of this algorithm is that the position of a vertex is replaced with the average of the positions of adjacent vertices.…”
Section: Smoothingmentioning
confidence: 99%
“…As such, the proposed approach is conceptually similar to an approach advanced by Liseikin [4], who writes the Beltrami equations employing a metric tensor derived from a monitor surface. Unlike Liseikin, the coarse-graining procedure, in which the average node positions are used to estimate the target metric tensor [5], is used on unstructured surface meshes.…”
Section: Introductionmentioning
confidence: 99%