An Efficient Algorithm for Shortest Path in Three Dimensions With Polyhedral Obstacles
1989 ◽
Vol 111
(3)
◽
pp. 433-436
◽
Keyword(s):
An algorithm to find the shortest path between two specified points in three-dimensional space in the presence of polyhedral obstacles is described. The proposed method iterates for the precise location of the minimum length path on a given sequence of edges on the obstacles. The iteration procedure requires solving a tri-diagonal matrix at each step. Both the computer storage and the number of computations are proportional to n, the number of edges in the sequence. The algorithm is stable and converges for the general case of any set of lines, intersecting, parallel or skew.
1926 ◽
Vol 110
(756)
◽
pp. 700-708
1996 ◽
Vol 210
(4)
◽
pp. 373-381
◽
1992 ◽
Vol 07
(10)
◽
pp. 2193-2206
◽
1955 ◽
Vol 51
(3)
◽
pp. 449-453
Keyword(s):
2021 ◽
Vol 1
(1)
◽
1954 ◽
Vol 222
(1149)
◽
pp. 262-286
◽
Keyword(s):