|
Scientific Visualization
| Issue Year: | 2014 |
| Quarter: | 4 |
| Volume: | 6 |
| Number: | 5 |
| Pages: | 24 - 34 |
|
| Article Name: |
OPTIMAL FILTERING OF AN ORDERED SET OF VISUALIZATION POINTS OF ROAD NETWORK BASED ON THE PRINCIPLES OF DISCRETE DYNAMIC PROGRAMMING |
| Authors: |
(Russian Federation), N.À. Kritsyna (Russian Federation), A.K. Belyakov (Russian Federation)
Article is submitted by National Research Nuclear University MEPhI (Moscow Engineering Physics Institute) |
| Address: |
kaf33@mephi.ru
National Research Nuclear University MEPhI (Moscow Engineering Physics Institute), Moscow, Russian Federation
N.À. Kritsyna
nak332005@yandex.ru
National Research Nuclear University MEPhI (Moscow Engineering Physics Institute), Moscow, Russian Federation
A.K. Belyakov
belyakov.mephi@gmail.com
National Research Nuclear University MEPhI (Moscow Engineering Physics Institute), Moscow, Russian Federation |
| Abstract: |
The paper focuses on the method of forming the optimal ordered selection of M points from the set of interpolation points of the curve, providing a minimum integral square error in-interpolation. A criterion presented as the sum of private in-integrally criteria is proposed to solve this problem. This approach allows to solve the general problem of optimization-term principle of the discrete Bellman dynamic programming. The proposed method is developed for use in geographic information systems in the formation of databases containing the interpolation points of lines (roads, borders and various other linear objects) for subsequent display on a map as well as the prefiltration of data caused by memory limitations when used in specialized navigation devices. |
| Language: |
English |
|
|
|
