|
Эта публикация цитируется в 3 научных статьях (всего в 3 статьях)
Optimization of the algorithm for determining the Hausdorff distance for convex polygons
Dmitry I. Danilov, Alexey S. Lakhtin Ural Federal University, Ekaterinburg, Russia
Аннотация:
The paper provides a brief historical analysis of problems that use the Hausdorff distance; provides an analysis of the existing Hausdorff distance optimization elements for convex polygons; and demonstrates an optimization approach. The existing algorithm served as the basis to propose low-level optimization with super-operative memory, ensuring the finding a precise solution by a full search of the corresponding pairs of vertices and sides of polygons with exclusion of certain pairs of vertices and sides of polygons. This approach allows a significant acceleration of the process of solving the set problem.
Ключевые слова:
Hausdorff distance, Polygon, Optimization, Optimal control theory, Differential games, Theory of image recognition.
Образец цитирования:
Dmitry I. Danilov, Alexey S. Lakhtin, “Optimization of the algorithm for determining the Hausdorff distance for convex polygons”, Ural Math. J., 4:1 (2018), 14–23
Образцы ссылок на эту страницу:
https://www.mathnet.ru/rus/umj52 https://www.mathnet.ru/rus/umj/v4/i1/p14
|
Статистика просмотров: |
Страница аннотации: | 191 | PDF полного текста: | 99 | Список литературы: | 34 |
|