Nonobtuse triangulation of polygons (Q1096930)
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 4032628
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonobtuse triangulation of polygons |
scientific article; zbMATH DE number 4032628 |
Statements
Nonobtuse triangulation of polygons (English)
0 references
1988
0 references
The authors solve a problem that occurs in partial differential equations (discretization). They triangulate any polygon without using obtuse triangles. Also they point out the impossibility of a simple divide-and- conquer approach. The methods used are elementary.
0 references
0.9502129
0 references
0 references
0.9327722
0 references
0 references
0 references
0 references
0.90733224
0 references
