Shortest 2D path between two points avoiding defined zones

1 次查看（过去 30 天）
Baptiste Labarthe
Baptiste Labarthe 2021-4-20
回答： Walter Roberson 2021-4-20
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

请先登录，再回答此问题。

采纳的回答

Walter Roberson
Walter Roberson 2021-4-20

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Graph and Network Algorithms 的更多信息

标签

Community Treasure Hunt

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

Start Hunting!

Translated by