Triangulating a convex polygon with fewer number of non-standard bars (Q2465634)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Triangulating a convex polygon with fewer number of non-standard bars |
scientific article; zbMATH DE number 5223677
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Triangulating a convex polygon with fewer number of non-standard bars |
scientific article; zbMATH DE number 5223677 |
Statements
Triangulating a convex polygon with fewer number of non-standard bars (English)
0 references
7 January 2008
0 references
triangulation
0 references
convex polygon
0 references
Mesh generation
0 references
0.9886686205863952
0 references
0.7906900644302368
0 references
0.7880241274833679
0 references
0.7684105038642883
0 references
