Nonobtuse triangulation of polygons (Q1096930): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: DBLP publication ID (P1635): journals/dcg/BakerGR88, #quickstatements; #temporary_batch_1731505720702 |
||
| (6 intermediate revisions by 5 users not shown) | |||
| Property / author | |||
| Property / author: Eric H. Grosse / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Günter Ewald / rank | |||
| Property / author | |||
| Property / author: Eric H. Grosse / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Günter Ewald / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56813846 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Angle Condition in the Finite Element Method / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Triangulation and shape-complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Condition of finite element matrices generated from nonuniform meshes. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Triangulating a simple polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The dissection of a polygon into nearly equilateral triangles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing Dirichlet Tessellations in the Plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An asymmetrical finite difference network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4127946 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5342712 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/dcg/BakerGR88 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
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
