Info
이 질문은 마감되었습니다. 편집하거나 답변을 올리려면 질문을 다시 여십시오.
Exploring shortest paths@ Steve
조회 수: 3 (최근 30일)
이전 댓글 표시
Regarding Steve's topic finding the shortest path, I'm now asked to find the shortest path for all the pixels of any two object. What do I mean by this: In the image below I want a path such that the whole T letter gets to S. Yes, that might be a challenging, involving some rotations, etc... but in my problem I only have circular objects.
![](https://www.mathworks.com/matlabcentral/answers/uploaded_files/158554/image.png)
![](https://www.mathworks.com/matlabcentral/answers/uploaded_files/158555/image.png)
So the question is: Can I have some restrictions such that the whole object gets to its destination? Thank you!
댓글 수: 1
답변 (0개)
이 질문은 마감되었습니다.
참고 항목
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!