Abstract
The problem of off-road routing and terrain discretization with using visibility graphs is considered. Traditionally, routing engines find a path over a road graph, but the problem of off-road routing is also relevant. A polygon approximation method is proposed as applied to constructing a visibility graph on a plane, as well as pathfinding without constructing a complete graph for solving the problem of off-road navigation. The developed algorithm for finding supporting lines to a convex polygon on a plane and a hierarchical approach to building a visibility graph are described. The considered approaches are implemented in a software system and applied to real geographic data.
Publisher
Keldysh Institute of Applied Mathematics
Reference8 articles.
1. М. де Берг, О. Чеонг, М. Кревельд, М. Овермарс «Вычислительная Геометрия» // ДМК Пресс, 2017
2. T. Sevilmiş, B. Mizrahi «Implementation of the visibility graph construction for a set of polygons for 2D in O(n2)» // Bilkent University, 21p., 2021
3. H. Rohnert «Shortest paths in the plane with convex polygonal obstacles» // Inform. Process. Lett., pp.71–76, 1986
4. Timothy M. Chan «Optimal output-sensitive convex hull algorithms in two and three dimensions» // Discrete and Computational Geometry, Vol. 16, pp.361–368, 1996
5. F.P. Preparata «An Optimal Real-Time Algorithm for Planar Convex Hulls» // University of Illinois, 4 p., 1979