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 Center および File Exchange で Voronoi Diagram についてさらに検索
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!