The smallest enclosing ball of balls: combinatorial structure and algorithms
From MaRDI portal
Recommendations
Cited in
(17)- On the ball spanned by balls
- Line transversals of balls and smallest enclosing cylinders in three dimensions
- A dual simplex-type algorithm for the smallest enclosing ball of balls
- Complexity and approximation of the smallest \(k\)-enclosing ball problem
- The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions
- scientific article; zbMATH DE number 6487863 (Why is no real title available?)
- Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
- Protein structure optimization by side-chain positioning via beta-complex
- scientific article; zbMATH DE number 3913428 (Why is no real title available?)
- Smallest enclosing ball for probabilistic data
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
- A new approach for the computation of halfspace depth in high dimensions
- Complexity and approximation of the smallest k-enclosing ball problem
- Approximate minimum enclosing balls in high dimensions using core-sets
- Computational Science and Its Applications – ICCSA 2004
- Collision detection for deforming necklaces
- On the smallest enclosing balls
This page was built for publication: The smallest enclosing ball of balls: combinatorial structure and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361635)