A linear time algorithm for max-min length triangulation of a convex polygon (Q845931)
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: A linear time algorithm for max-min length triangulation of a convex polygon |
scientific article; zbMATH DE number 5664759
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for max-min length triangulation of a convex polygon |
scientific article; zbMATH DE number 5664759 |
Statements
A linear time algorithm for max-min length triangulation of a convex polygon (English)
0 references
29 January 2010
0 references
computational geometry
0 references
max-min length triangulation
0 references
max-min length \(k\)-set triangulation
0 references
0.8703571557998657
0 references
0.8688884377479553
0 references
0.8282457590103149
0 references
0.813800036907196
0 references
0.813123881816864
0 references
