Answer the question
In order to leave comments, you need to log in
Is there an algorithm for finding a path between two points?
There are 2 points on the plane.
I need to build the minimum path between these points avoiding obstacles.
The obstacles themselves are represented as quadrilaterals and other paths.
Is there something similar?
To make it clearer - imagine a printed circuit board, and the tracks routed on it.
Answer the question
In order to leave comments, you need to log in
the wave algorithm should work very well for the PCB analogy.
There are several examples of usage on Habré.
https://ru.wikipedia.org/wiki/Lee_algorithm
Didn't find what you were looking for?
Ask your questionAsk a Question
731 491 924 answers to any question