Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q62037452, #quickstatements; #temporary_batch_1710970253704 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q62037452 / rank | |||
Normal rank | |||
Revision as of 22:35, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for approximate shortest path queries on weighted polyhedral surfaces |
scientific article |
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
