A 2D advancing-front Delaunay mesh refinement algorithm (Q2230400)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7396865
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 2D advancing-front Delaunay mesh refinement algorithm |
scientific article; zbMATH DE number 7396865 |
Statements
A 2D advancing-front Delaunay mesh refinement algorithm (English)
0 references
17 September 2021
0 references
This article discusses a generalization of Chew's first algorithm for Delaunay mesh refinement. The approach relies on generating well-graded meshes by refining the planar straight line graph such that the lengths of the split segments are asymptotically proportional to the local feature size at the end points of the split segments. Further, the Steiner vertices are inserted in an advancing front manner in order to obtain a size-optimal, truly or constrained Delaunay mesh.
0 references
Delaunay mesh refinement
0 references
advancing-front meshes
0 references
size-optimal meshes
0 references
0 references
0.8552821278572083
0 references
0.853198766708374
0 references
0.8526066541671753
0 references
0.8526066541671753
0 references
