Pages that link to "Item:Q2162517"
From MaRDI portal
The following pages link to Covering a simplex by spheres: complexity and algorithms (Q2162517):
Displaying 7 items.
- Spherical coverage verification (Q440948) (← links)
- On determining the cover of a simplex by spheres centered at its vertices (Q645552) (← links)
- A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes (Q689920) (← links)
- Angle covers: algorithms and complexity (Q782165) (← links)
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) (← links)
- New analysis of the sphere covering problems and optimal polytope approximation of convex bodies (Q1775011) (← links)
- Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere (Q5146824) (← links)