Pages that link to "Item:Q338040"
From MaRDI portal
The following pages link to Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space (Q338040):
Displaying 9 items.
- Algorithms for constructing optimal \(n\)-networks in metric spaces (Q1675840) (← links)
- Iterative method for constructing coverings of the multidimensional unit sphere (Q2840248) (← links)
- On reserve and double covering problems for the sets with non-Euclidean metrics (Q3388412) (← links)
- Methods of optimization of Hausdorff distance between convex rotating figures (Q3388837) (← links)
- Minimax Generalized Solutions of Hamilton-Jacobi Equations in Dynamic Bimatrix Games (Q5048469) (← links)
- (Q5153818) (← links)
- Chebyshev centres, Jung constants, and their applications (Q5220255) (← links)
- Algorithms of optimal set covering on the planar R^2 (Q5266487) (← links)
- Algorithms and Computation (Q5897901) (← links)
