A New Heuristic for Minimum Weight Triangulation (Q3801070)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4068280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A New Heuristic for Minimum Weight Triangulation |
scientific article; zbMATH DE number 4068280 |
Statements
A New Heuristic for Minimum Weight Triangulation (English)
0 references
1987
0 references
computational geometry
0 references
minimum spanning tree
0 references
running time
0 references
heuristic
0 references
minimum weight triangulation
0 references
planar point sets
0 references
polygon
0 references
dynamic programming
0 references
uniform point distribution
0 references
almost certainly
0 references
0 references
0.9296054840087892
0 references
0.9233570098876952
0 references
0.8551644086837769
0 references
0.8527220487594604
0 references
