WHEN AND WHY DELAUNAY REFINEMENT ALGORITHMS WORK (Q4676181)
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 2164326
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | WHEN AND WHY DELAUNAY REFINEMENT ALGORITHMS WORK |
scientific article; zbMATH DE number 2164326 |
Statements
WHEN AND WHY DELAUNAY REFINEMENT ALGORITHMS WORK (English)
0 references
3 May 2005
0 references
Mesh generation
0 references
Ruppert's algorithm
0 references
computational geometry
0 references
triangulation
0 references
Delaunay refinement algorithm
0 references
0.8755573630332947
0 references
0.8755573630332947
0 references
0.8701584935188293
0 references
0.8358968496322632
0 references
