Obtain Graph (G) from voronoi data for applying Dijkstra's or A* algorithm

2 次查看(过去 30 天)
Hi,
I made a Voronoi diagram from command "[Vx,Vy] = voronoi(X,Y)" where (X,Y) are the set of cites.
Now, I would like to get a shortest path using Dijkstra's or A* algorithm for which I need to convert voronoi data into a graph matrix.
Please let me know how can I convert voronoi data to a feasible graph matrix so I can apply shortestditance algorithm.

回答(0 个)

类别

Help CenterFile Exchange 中查找有关 Voronoi Diagram 的更多信息

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by