Algorithms for optimal area triangulations of a convex polygon (Q2432732)
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: Algorithms for optimal area triangulations of a convex polygon |
scientific article; zbMATH DE number 5067531
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for optimal area triangulations of a convex polygon |
scientific article; zbMATH DE number 5067531 |
Statements
Algorithms for optimal area triangulations of a convex polygon (English)
0 references
25 October 2006
0 references
convex polygons
0 references
dynamic programming
0 references
MaxMin area triangulation
0 references
algorithms
0 references
MinMax area triangulation
0 references
0.8815558552742004
0 references
0.813800036907196
0 references
0.8036962151527405
0 references
