Nonobtuse triangulation of polygons (Q1096930): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q56813846, #quickstatements; #temporary_batch_1709751086066 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56813846 / rank | |||
Normal rank | |||
Revision as of 20:02, 6 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nonobtuse triangulation of polygons |
scientific article |
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
