New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations (Q2755780)
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 1672140
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations |
scientific article; zbMATH DE number 1672140 |
Statements
12 November 2001
0 references
unstructured triangulations
0 references
longest-edge propagation path
0 references
algorithms
0 references
backward longest-edge refinement algorithm
0 references
Delaunay triangulations
0 references
mesh generation
0 references
mesh refinement
0 references
mesh improvement
0 references
New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations (English)
0 references
0.8084290623664856
0 references
0.8084002733230591
0 references
0.8029129505157471
0 references
