shortest path in 2D matrix between two coordinate points
Mostrar comentarios más antiguos
As in the attached image, i have a 2D matrix of 50 by 50. The matrix contains zeros (blue) and ones(yellow). Imagine it as a floor, The yellow or ones mean the walls. In this whole matrix a transmitter(T) and receiver (R) can be placed anywhere and i need to know how many walls the signal penetrates when it reaches from T to R. Lets suppose the T is at (x,y) and R is at (i,j). I take the shortest path between T and R. If i get the shortest path i can calculate the number of 1s in the path and that will be the number of walls which i need.
Can anyone help in this regard.. Thank you
Respuesta aceptada
Más respuestas (2)
Image Analyst
el 5 de Jul. de 2018
0 votos
Use bwdistgeodesic().
See Steve's 5 part blog on shortest paths.
1 comentario
Sohaib Bin Altaf
el 7 de Jul. de 2018
Sohaib Bin Altaf
el 10 de Jul. de 2018
0 votos
Categorías
Más información sobre Dijkstra algorithm en Centro de ayuda y File Exchange.
Productos
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!