Nonobtuse triangulation of polygons (Q1096930)

From MaRDI portal
Revision as of 20:13, 12 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Nonobtuse triangulation of polygons
scientific article

    Statements

    Nonobtuse triangulation of polygons (English)
    0 references
    0 references
    0 references
    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 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references