Efficiently determining a locally exact shortest path on polyhedral surfaces (Q628181)
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: Efficiently determining a locally exact shortest path on polyhedral surfaces |
scientific article; zbMATH DE number 5861467
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficiently determining a locally exact shortest path on polyhedral surfaces |
scientific article; zbMATH DE number 5861467 |
Statements
Efficiently determining a locally exact shortest path on polyhedral surfaces (English)
0 references
4 March 2011
0 references
computational geometry
0 references
shortest paths
0 references
discrete geodesics
0 references
fast marching method
0 references
0.9473757
0 references
0.93858546
0 references
0.93858546
0 references
0.9353639
0 references
0.9311389
0 references
0.93053293
0 references
0.91914195
0 references
0.9186312
0 references
