Towards the methodology for solving the minimum enclosing ball and related problems
Not on the map. Why?
Abstract (arXiv)
Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean space. Mathematical formulation and typical methods for solving this problem are presented. Also, the paper is focused on areas that are related to this problem, namely: (a) promise problems and property testing, (b) theorems for partitioning and enclosing (covering) a set, and (c) computation of the diameter of a set.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 105 references that are in the map. First posted on arXiv 14 Oct 2024.
Builds on
8 of 105 references.
References · 8
- 2018Theorems of Carath'eodory, Helly, and Tverberg without dimensioncited by 4
- 2013Helly-Type Theorems in Property Testingcited by 2
- 2017The discrete yet ubiquitous theorems of Carath'eodory, Helly, Sperner, Tucker, and Tverbergcited by 2
- 2022Testing Distributions of Huge Objectscited by 2
- 2024Generalization of the Apollonius theorem for simplices and related problemscited by 2
- 2021Strongly Sublinear Algorithms for Testing Pattern Freenesscited by 1
- 2023Geometric Covering using Random Fieldscited by 1
- 2024Towards the mathematical foundation of the minimum enclosing ball and related problemscited by 1
Built on by
Not cited yet.