Shortest 2D path between two points avoiding defined zones

1 visualizzazione (ultimi 30 giorni)
Baptiste Labarthe
Baptiste Labarthe il 20 Apr 2021
Risposto: Walter Roberson il 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

Accedi per rispondere a questa domanda.

Risposta accettata

Walter Roberson
Walter Roberson il 20 Apr 2021

Più risposte (0)

Categorie

Scopri di più su Graph and Network Algorithms in Help Center e File Exchange

Tag

Community Treasure Hunt

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

Start Hunting!

Translated by