提出求解最小包围球问题的方法，涵盖数学建模与相关理论。
Towards the methodology for solving the minimum enclosing ball and related problems
- 构建d维欧氏空间中最小包围球的数学模型
- 给出求解最小包围球的标准方法与理论框架
- 延伸至集合直径计算与分割覆盖定理等关联问题
本文提供了解决最小包围球问题的方法论。该问题旨在确定包含给定有界集合的最小半径球面，存在于d维欧氏空间中。论文给出了该问题的数学表述及典型求解方法，并聚焦于与其相关的三个领域：(a) 约束问题与性质测试，(b) 集合划分与覆盖定理，(c) 集合直径的计算。这些拓展为理解几何优化问题提供了理论基础。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。