Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866)
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: Algorithms for approximate shortest path queries on weighted polyhedral surfaces |
scientific article; zbMATH DE number 5813752
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for approximate shortest path queries on weighted polyhedral surfaces |
scientific article; zbMATH DE number 5813752 |
Statements
Algorithms for approximate shortest path queries on weighted polyhedral surfaces (English)
0 references
8 November 2010
0 references
shortest path
0 references
query algorithm
0 references
separator
0 references
weighted polyhedral surface
0 references
approximation graph
0 references
Steiner points
0 references
weighted surface partioning
0 references
0 references
0.9766656756401062
0 references
0.8911679983139038
0 references
0.8760229349136353
0 references
0.8748909831047058
0 references
0.874377429485321
0 references
