3-Dimensional Shortest Path
显示 更早的评论
Hello, I have a question about the shortest path algorithm.
I want to find shortest path in 3 dimensional space(for example, latitude, longitude, and altitude) I think it's possible that using "graphshortestpath" function in matlab is fine.
But in this case it's hard to make a graph matrix and a edge matrix...
So if someone knows that an efficient way to make for shortest path algorithm for 3 dimensional space, please help me.
Thanks in advance!
采纳的回答
Ahmet Cecen
2016-3-3
0 个投票
You are in luck. I have just released a code that does the very exact thing you want to the FileExchange. If you really need to use the toolbox function graphshortestpath, contact me for a version that uses that. Check the earlier sections of the file to find the efficient way to convert volumetric data into a graph, which should be the fastest most efficient way in the west (well while using MATLAB).
3 个评论
Helio
2016-3-3
Timothy Turk
2020-10-5
I get the following error when I try to run this. Can you help? I have installed Visual Studio for Windows.
Please Install a Compatible C++ Compiler (Like Visual Studio Compilers for Windows)Not enough input arguments.
Error in Tort3D (line 36)
[nx,ny,nz] = size(Alpha);
Walter Roberson
2020-10-5
The most common cause for that error would be if you were using an old enough version of MATLAB that function names were still not case-sensitive (quite a while ago!) so that the Alpha was being treated as alpha and that alpha() function was being executed -- the alpha() function requires an input argument.
This in turn would require that Alpha (or alpha) had not been assigned to in the code at a point where the code expected it had been assigned to.
更多回答（1 个）
Walter Roberson
2016-3-3
0 个投票
The A* and Dijkstra algorithms do not care at all about how many dimensions the graph is embedded in: they only care about the connection information and the distances (or the two combined in one.)
3 个评论
Ahmet Cecen
2016-3-3
编辑：Ahmet Cecen
2016-3-3
This is true, but graphshortestpath and similar functions will almost always require data in the form of an adjacency matrix, which is 2D. The problem here if I relate correctly is not that the graph is embedded in 3D, it is that there is no graph, simply volumetric data like a 3D maze for example: the corridors are 1s and walls are 0s. How do I transform that 3D maze into a 2D adjacency matrix in the most time and memory efficient way possible with MATLAB? That is the problem the submission I refer to solves. The rest is easy-peasy as you mentioned.
Helio
2016-3-3
Steven Lord
2016-3-3
The shortestpath method for graph and digraph objects that was introduced in release R2015b can work on a weighted graph object. There's an example on that function's documentation page.
类别
在 帮助中心 和 File Exchange 中查找有关 Graph and Network Algorithms 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
