Optimization of the Hausdorff distance between sets in Euclidean space
From MaRDI portal
Publication:265867
DOI10.1134/S0081543815090151zbMath1338.49070OpenAlexW2279156160MaRDI QIDQ265867
A. S. Lakhtin, V. N. Ushakov, Pavel Dmitrievich Lebedev
Publication date: 13 April 2016
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0081543815090151
optimizationnonsmooth analysispolytopesHausdorff distancenumerical algorithmbest \(n\)-netsdisk cover
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space ⋮ Algorithms for constructing optimal \(n\)-networks in metric spaces ⋮ Algorithms for constructing suboptimal coverings of plane figures with disks in the class of regular lattices ⋮ OPTIMIZATION OF THE ALGORITHM FOR DETERMINING THE HAUSDORFF DISTANCE FOR CONVEX POLYGONS ⋮ Chebyshev centres, Jung constants, and their applications ⋮ Methods of optimization of Hausdorff distance between convex rotating figures ⋮ Unnamed Item
Cites Work
- On segmenting logistical zones for servicing continuously developed consumers
- Properties of the optimal ellipsoids approximating the reachable sets of uncertain systems
- An approach to optimization in transport logistics
- Differential games with fixed terminal time and estimation of the instability degree of sets in these games
- Ellipsoidal calculus for estimation and control
- Approximation of polygons with the best set of circles
- Approximating sets on a plane with optimal sets of circles
- Minimization of the Hausdorff distance between convex polyhedrons
- Algorithms of the best approximations of the flat sets by the union of circles
- Optimization of multiple covering of a bounded set with circles
- A computational algorithm for optimally covering a plane region
- Convex Analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimization of the Hausdorff distance between sets in Euclidean space
