Shortest path on a non-convex polyhedron (Q1433539)
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 2076124
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest path on a non-convex polyhedron |
scientific article; zbMATH DE number 2076124 |
Statements
Shortest path on a non-convex polyhedron (English)
0 references
18 June 2004
0 references
The authors present an algorithm to solve the shortest-path problem between two points \(A\) and \(B\) on a non-convex polyhedron in the 3-dimensional space. The algorithm constructs first all possible edge-sequences and optimizes their order. Then the points on each of the obtained edge-sequences are computed which determine the path between \(A\) and \(B\) using this edge-sequence. No detailed complexity analysis is provided.
0 references
shortest path
0 references
nonconvex polyhedron
0 references
0.7767730355262756
0 references
0.7697911858558655
0 references
0.7573739886283875
0 references
