Iterative method for constructing coverings of the multidimensional unit sphere
From MaRDI portal
Recommendations
- Nearly optimal coverings of a sphere with generalized spherical segments
- Iterative methods for approximations constructing of optimal covering for nonconvex plane sets
- A method of covering a convex polyhedral region by a minimal number of congruent spheres
- Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space
- Spherical cap discrepancy and inequalities on the sphere
Cited in
(9)- Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
- Optimal non-adaptive approximation of convex bodies by polytopes
- Approximation of the effective hull of a nonconvex multidimensional set given by a nonlinear mapping
- Comparison of two Pareto frontier approximations
- Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls
- Method for constructing an external polyhedral estimate of the trajectory tube for a nonlinear dynamic system
- New external estimate for the reachable set of a nonlinear multistep dynamic system
- Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball
- Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls
This page was built for publication: Iterative method for constructing coverings of the multidimensional unit sphere
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840248)
