scientific article; zbMATH DE number 3913428
De même qu'on calcule la médiane d'une distribution de points sur la droite, on souhaiterait en analyse des données multidimensionnelles, déterminer par un algorithme rapide, le centre et le rayon de la plus petite boule contenant un ensemble fini donné de points d'un espace euclidien. (From author's introduction.) It is shown that in the case of a Euclidean or Hilbertian ambient space the minimal ball containing a restricted part of the space exists and is unique. This uniqueness does not always hold in any given normed space. Using, to a greater or lesser degree, general geometric considerations, an algorithm which is valid for a finite part of Euclidean space is proposed.
- scientific article; zbMATH DE number 3909016
- On the elimination of inessential points in the smallest enclosing ball problem
- scientific article; zbMATH DE number 2079414
- The smallest enclosing ball of balls: combinatorial structure and algorithms
- A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3689995)