Provably good mesh generation (Q1329150)
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 598082
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Provably good mesh generation |
scientific article; zbMATH DE number 598082 |
Statements
Provably good mesh generation (English)
0 references
1 November 1994
0 references
It is shown how to triangulate a planar point set with (a) triangles of bounded aspect ratio, (b) triangles having no obtuse angles, (c) how to triangulate a point set of arbitrary dimension with simplices of bounded aspect ratio, and (d) how to produce a linear-size Delaunay triangulation of a multidimensional point set by adding a linear number of extra points. All the triangulations have optimal size within a constant factor and run in optimal time.
0 references
mesh generation
0 references
Delaunay triangulation
0 references
0.8545264005661011
0 references
0.8545264005661011
0 references
0.8467116951942444
0 references
0.8180526494979858
0 references
