Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00454-009-9204-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2074682596 / rank | |||
Normal rank | |||
Revision as of 23:01, 19 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
