Provably good mesh generation (Q1329150): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Marshall W. Bern / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: John R. Gilbert / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Plamen Yordanov Yalamov / rank | |||
Normal rank | |||
Revision as of 08:54, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Provably good mesh generation |
scientific article |
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
