Methods of optimization of Hausdorff distance between convex rotating figures

DOI10.2298/YJOR191125027LzbMath1474.52019OpenAlexW3047485078MaRDI QIDQ3388837

V. N. Ushakov, Pavel Dmitrievich Lebedev

Publication date: 7 May 2021

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/yjor191125027l

zbMATH Keywords

optimizationrotationHausdorff distanceChebyshev centreone-sided derivative

Mathematics Subject Classification ID

Convex programming (90C25) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Uses Software

• Matlab

Cites Work

• Optimization of the Hausdorff distance between sets in Euclidean space
• Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space
• Algorithms for constructing optimal \(n\)-networks in metric spaces
• On reserve and double covering problems for the sets with non-Euclidean metrics
• OPTIMIZATION OF THE ALGORITHM FOR DETERMINING THE HAUSDORFF DISTANCE FOR CONVEX POLYGONS
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Methods of optimization of Hausdorff distance between convex rotating figures