Shortest 2D path between two points avoiding defined zones

1 view (last 30 days)
Baptiste Labarthe
Baptiste Labarthe on 20 Apr 2021
Answered: Walter Roberson on 20 Apr 2021
Hello,
I am working on a way to build the shortest possible path between two points in 2D (x,y). This path shall be discrete points used to avoid specific rectangle zones specified by 4 points (the vertices).
Does anyone knows about previous work on the subject?
Thankssss :D

Sign in to answer this question.

Accepted Answer

Walter Roberson
Walter Roberson on 20 Apr 2021

More Answers (0)

Categories

Find more on Graph and Network Algorithms in Help Center and File Exchange

Tags

Community Treasure Hunt

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

Start Hunting!