An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (Q3619956)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5542509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal-time algorithm for shortest paths on a convex polytope in three dimensions |
scientific article; zbMATH DE number 5542509 |
Statements
14 April 2009
0 references
continuous Dijkstra
0 references
geodesics
0 references
polytope surface
0 references
0.9999996423721312
0 references
0.8974533677101135
0 references
0.8904130458831787
0 references
0.8873714208602905
0 references
