An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (Q2482203): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710423558064 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00454-007-9031-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2132432991 / rank | |||
Normal rank | |||
Revision as of 15:33, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal-time algorithm for shortest paths on a convex polytope in three dimensions |
scientific article |
Statements
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (English)
0 references
16 April 2008
0 references
continuous Dijkstra geodesics
0 references
polytope surface
0 references
shortest path
0 references
shortest path map
0 references
unfolding
0 references
wavefront
0 references
