The article introduces a new algorithm for finding optimal routes on raster planes. This method takes advantage of the new data structure and results in minimizing the number of direction changes within a route. It has linear time and space complexities and is sufficiently fast to perform real-time routing on the raster grids. Both the algorithm and its data structure are presented in detail in the paper. Possible applications of this method are also discussed.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.