Please use this identifier to cite or link to this item:
|Title:||Methods of optimization of hausdorff distance between convex rotating figures|
|Publisher:||Faculty of Organizational Sciences, Belgrade|
|Citation:||Lebedev P. Methods of optimization of hausdorff distance between convex rotating figures / P. Lebedev, V. Ushakov. — DOI 10.2298/YJOR191125027L // Yugoslav Journal of Operations Research. — 2020. — Vol. 30. — Iss. 4. — P. 429-442.|
|Abstract:||We studied the problem of optimizing the Hausdorff distance between two convex polygons. Its minimization is chosen as the criterion of optimality. It is believed that one of the polygons can make arbitrary movements on the plane, including parallel transfer and rotation with the center at any point. The other polygon is considered to be motionless. Iterative algorithms for the phased shift and rotation of the polygon are developed and implemented programmatically, providing a decrease in the Hausdorff distance between it and the fixed polygon. Theorems on the correctness of algorithms for a wide class of cases are proved. Moreover, the geometric properties of the Chebyshev center of a compact set and the differential properties of the Euclidean function of distance to a convex set are essentially used. When implementing the software package, it is possible to run multiple times in order to identify the best found polygon position. A number of examples are simulated. © 2020 Faculty of Organizational Sciences, Belgrade. All rights reserved.|
|Appears in Collections:||Научные публикации, проиндексированные в SCOPUS и WoS CC|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.