Pages that link to "Item:Q689920"
From MaRDI portal
The following pages link to A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes (Q689920):
Displaying 12 items.
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) (Q301399) (← links)
- A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) (Q833570) (← links)
- Calculating a minimal sphere containing a polytope defined by a system of linear inequalities (Q1326513) (← links)
- The minimum covering \(l_{pb}\)-hypersphere problem (Q1383828) (← links)
- A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\) (Q1941021) (← links)
- Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities (Q2494476) (← links)
- CONSTRAINED OPTIMAL LOCATION (Q2748922) (← links)
- An efficient search algorithm for minimum covering polygons on the sphere (Q2847730) (← links)
- Approximation by spheres (Q3978914) (← links)
- Spherical Discrepancy Minimization and Algorithmic Lower Bounds for Covering the Sphere (Q5146824) (← links)
- Chebyshev centres, Jung constants, and their applications (Q5220255) (← links)
- The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\) (Q6103201) (← links)
