Method of routing with obstacles based on parallel computing

Abstract

We propose a new effective method of finding the minimal geodesic path in a 2D environment with polygonal obstacles. We describe continuous solution that uses visibility graph for polygonal obstacles. The problem of binary image vectorization and approximation is solved with a controlled accuracy. GPU computation is used to speed up the calculations.