Approximating shortest paths on a nonconvex polyhedron (Q2706111)
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: Approximating shortest paths on a nonconvex polyhedron |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating shortest paths on a nonconvex polyhedron |
scientific article |
Statements
19 March 2001
0 references
approximation algorithms
0 references
Euclidean shortest paths
0 references
computational geometry
0 references
0.96504205
0 references
0 references
0.9506991
0 references
0.94800377
0 references
0.9473472
0 references
0.9446432
0 references
0.9413482
0 references
0 references
0.9338142
0 references
Approximating shortest paths on a nonconvex polyhedron (English)
0 references
