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!