Nonobtuse triangulation of polygons (Q1096930): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56813846, #quickstatements; #temporary_batch_1709751086066
ReferenceBot (talk | contribs)
Changed an Item
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

Revision as of 13:04, 18 June 2024

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
    0 references