V. M. Yakovenko
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
V. M. Yakovenko has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Mykhaylo I. Schlesinger
International Research and Training Centre of Information Technologies and Systems National Academy of Science of Ukraine Cybernetica Centre, prospect Academica Glushkova GSP 40 Kiev-680 03680 Ukraine
3 shared publications - Evgeniy Vodolazskiy
Institute of Information Technologies and Systems, National Academy of Sciences of Ukraine, Kyiv, Ukraine
2 shared publications - Y. V. Vodolazskii
MES and NAS of Ukraine
1 shared publication
Latest Publications
- Open Access
Frechet similarity of closed polygonal curves
The article analyzes similarity of closed polygonal curves with respect to the Frechet metric, which is stronger than the well-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm is described that determines whether the Frechet distance between two closed polygonal curves with m and n vertices is less than a given number. The algorithm takes O(mn) time whereas the previously known algorithms take O(mn log(mn)) time.
Open AccessFrechet similarity of closed polygonal curves
The article analyzes similarity of closed polygonal curves with respect to the Frechet metric, which is stronger than the well-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm is described that determines whether the Frechet distance between two closed polygonal curves with m and n vertices is less than a given number. The algorithm takes O(mn) time whereas the previously known algorithms take O(mn log(mn)) time.
- Open Access
Similarity of closed polygonal curves in Frechet metric
The article analyzes similarity of closed polygonal curves in Frechet metric, which is stronger than the well-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm that determines whether the Frechet distance between two closed polygonal curves with m and n vertices is less than a given number is described. The described algorithm takes O(mn) time whereas the previously known algorithms take O(mn log(mn)) time.
Open AccessSimilarity of closed polygonal curves in Frechet metric
The article analyzes similarity of closed polygonal curves in Frechet metric, which is stronger than the well-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm that determines whether the Frechet distance between two closed polygonal curves with m and n vertices is less than a given number is described. The described algorithm takes O(mn) time whereas the previously known algorithms take O(mn log(mn)) time.
- 1 May 2014
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 50 (3) , 476-486
Recognizing the Similarity of Polygons in a Strengthened Hausdorff Metric
- 1 May 2014
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 50 (3) , 476-486
Recognizing the Similarity of Polygons in a Strengthened Hausdorff Metric