SET OF INTERPOLATION POINTS OPTIMIZATION USING DISRETE DYNAMIC PROGRAMMING PRINCELPES

Beliakov A.K, Kritsyna N.A, Kulyabichev Y.P, Sukhanov A.A

209 KB

In article we suggests method of forming the optimal ordered set of points from the set of interpolation points described an arbitrary curved line. Our method providing a minimum integral square error of interpolation. To solve the problem we suggest a criterion presented in the form of a sum of partial integral criteria. This approach allows use Bellman’s general principle of the discrete dynamic programming to solve the optimization problem. The proposed method are being developed for use in geographic information systems at formation of databases containing lines presented as set of interpolation points (roads, borders and various other linear objects) for subsequent displaying on a map of the area. Also for the preliminary filtering of data for use in specialized navigation devices, caused by the limitations of memory of such devices.

Библиографическая ссылка

Беляков А.К, Крицына Н.А, Кулябичев Ю.П, Суханов А.А ОПТИМИЗАЦИЯ НАБОРА ИНТЕРПОЛЯЦИОННЫХ ТОЧЕК ЛИНЕЙНОГО ОБЪЕКТА НА ОСНОВЕ ПРИНЦИПОВ ДИСКРЕТНОГО ДИНАМИЧЕСКОГО ПРОГРАММИРОВАНИЯ // Научное обозрение. Физико-математические науки . 2020. № 1. С. 21-21;
URL: https://physics-mathematics.ru/en/article/view?id=14 (дата обращения: 24.06.2026).