Traversing a set of points with a minimum number of turns (Q5901749)
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: Traversing a set of points with a minimum number of turns |
scientific article; zbMATH DE number 5551251
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Traversing a set of points with a minimum number of turns |
scientific article; zbMATH DE number 5551251 |
Statements
Traversing a set of points with a minimum number of turns (English)
0 references
6 May 2009
0 references
computational geometry
0 references
minimum link spanning path
0 references
approximation algorithms
0 references
0.9999999
0 references
0.93436337
0 references
0.89849603
0 references
0 references
0 references
0.8497626
0 references
0.8415335
0 references
0.8409346
0 references
0.8382456
0 references
