|
Engineering Geometry and Computer Graphics
Method of routing with obstacles based on parallel computing
K. A. Zaeva, A. B. Semenov Tver State University
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.
Keywords:
pathfinding, environment with obstacles, vectorization of images, visibility graph, GPU, technology CUDA.
Received: 29.03.2016 Revised: 15.05.2016
Citation:
K. A. Zaeva, A. B. Semenov, “Method of routing with obstacles based on parallel computing”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2016, no. 3, 85–95
Linking options:
https://www.mathnet.ru/eng/vtpmk23 https://www.mathnet.ru/eng/vtpmk/y2016/i3/p85
|
Statistics & downloads: |
Abstract page: | 295 | Full-text PDF : | 365 | References: | 52 |
|