Design and Analysis of Algorithm for Smooth Stiching of Electronic Navigation Charts

The article is devoted to a method of geographic maps stitching. Geographic maps are stitched as surfaces are merged. Surfaces are obtained after triangulation of geographic maps. Transition between surfaces must be continuous. This article describes a solving of the problem as an algorithm of adding points to boundaries of maps. Each that point of some map is added with corresponding point that has same coordinates and belongs to anther adjacent map. These points help to get continuous surface after maps triangulation. The algorithm is based on graph construction, which is obtained by map boundaries and intersection polygons between maps. Also in the paper a comparison is made between the algorithm and algorithm that includes checking each points if it belongs to some map polygons. Comparison shows first algorithm has more performance then second algorithm if a total number of points in maps boundaries much more than total number of new points.