Computing approximate shortest paths on convex polytopes (Q1601017)
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: Computing approximate shortest paths on convex polytopes |
scientific article; zbMATH DE number 1756783
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing approximate shortest paths on convex polytopes |
scientific article; zbMATH DE number 1756783 |
Statements
Computing approximate shortest paths on convex polytopes (English)
0 references
17 June 2002
0 references
shortest path on a polyhedral surface
0 references
0.9287685751914978
0 references
0.9282469749450684
0 references
0.9225478768348694
0 references
0.9067853689193726
0 references
