Nonobtuse triangulation of polygons (Q1096930): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/dcg/BakerGR88, #quickstatements; #temporary_batch_1731505720702 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/dcg/BakerGR88 / rank | |||
Normal rank | |||
Latest revision as of 15:00, 13 November 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
