Shortest 2D path between two points avoiding defined zones

1 Ansicht (letzte 30 Tage)
Baptiste Labarthe
Baptiste Labarthe am 20 Apr. 2021
Beantwortet: Walter Roberson am 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

Melden Sie sich an, um diese Frage zu beantworten.

Akzeptierte Antwort

Walter Roberson
Walter Roberson am 20 Apr. 2021

Weitere Antworten (0)

Kategorien

Mehr zu Graph and Network Algorithms finden Sie in Help Center und File Exchange

Tags

Community Treasure Hunt

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

Start Hunting!

Translated by