Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space
From MaRDI portal
Publication:338040
DOI10.1134/S0081543816050205zbMath1385.90024OpenAlexW2471066924MaRDI QIDQ338040
V. N. Ushakov, Pavel Dmitrievich Lebedev
Publication date: 3 November 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/s0081543816050205
Related Items (5)
Minimax Generalized Solutions of Hamilton-Jacobi Equations in Dynamic Bimatrix Games ⋮ Chebyshev centres, Jung constants, and their applications ⋮ On reserve and double covering problems for the sets with non-Euclidean metrics ⋮ Methods of optimization of Hausdorff distance between convex rotating figures ⋮ Unnamed Item
Cites Work
- 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
- Optimization of the Hausdorff distance between sets in Euclidean space
- On segmenting logistical zones for servicing continuously developed consumers
- On the question of the stability defect of sets in an approach game problem
- An algorithm for a posteriori minimax estimation of states of discrete dynamic systems. II
- An algorithm for a posteriori minimax estimation of states of discrete dynamic systems. I
- Best approximations of convex compact sets by balls in the Hausdorff metric
- Approximating sets on a plane with optimal sets of circles
- Around Borsuk's hypothesis
- Über ein euklidisch-geometrisches Problem von B. Grünbaum
- Algorithms of the best approximations of the flat sets by the union of circles
- Mathematical Explorations with MATLAB
- A computational algorithm for optimally covering a plane region
- Geometric Set Cover and Hitting Sets for Polytopes in R
- Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
This page was built for publication: Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space
