14th Computational Fluid Dynamics Conference 1999
DOI: 10.2514/6.1999-3253
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic adaptation for deforming tetrahedral meshes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
31
0

Year Published

2003
2003
2018
2018

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 42 publications
(31 citation statements)
references
References 3 publications
0
31
0
Order By: Relevance
“…Trajectories can thus be assigned to inner vertices, or in other words, positions at a future solver time step. Several techniques can be found to compute this displacement field: implicit or direct interpolation [13,44], or solving PDEs-the most common of which being Laplacian smoothing [40], a spring analogy [19] and a linear elasticity analogy [6]. It is this last method that we selected, due to its robustness in 3D [58].…”
Section: Linear Elasticity Mesh Deformation Methodsmentioning
confidence: 99%
“…Trajectories can thus be assigned to inner vertices, or in other words, positions at a future solver time step. Several techniques can be found to compute this displacement field: implicit or direct interpolation [13,44], or solving PDEs-the most common of which being Laplacian smoothing [40], a spring analogy [19] and a linear elasticity analogy [6]. It is this last method that we selected, due to its robustness in 3D [58].…”
Section: Linear Elasticity Mesh Deformation Methodsmentioning
confidence: 99%
“…The first achievements made to supply r -adaptive methods with the local mesh modifications consisted in applying refinement/coarsening procedures according to both shape and deformation measures of the elements [4,5]. The robustness of the method was improved recently by adding edge and face swaps to eliminate sliver elements [6,7].…”
Section: G Compère Et Almentioning
confidence: 99%
“…The coarsening procedure described in Reference [11] was based on the use of edge collapse in both 2D and 3D. Given edge AB, the two points A and B would be replaced by a new point P at the mid-point of edge AB, the edge AB and the two triangles (the ring of tetrahedra in 3D) incident to edge AB would be removed and the data structure would be updated to correspond to the new mesh that contains one less point.…”
Section: Mesh Coarsening By Edge Collapsementioning
confidence: 99%
“…Mesh coarsening can be achieved by the use of an edge collapse technique whenever the length density function is large compared to the actual mesh length scale h [11].…”
Section: Length Density Functionmentioning
confidence: 99%