On Computing the Maximum Distance to a Fixed Point Over an Intersection of Balls
Marius Costandin · Studia Scientiarum Mathematicarum Hungarica · 2024
In this paper the author studies the problem of finding the farthest points in an intersection of balls to a given point 𝐶0. A polynomial algorithm is presented which solves the problem under the conditions that the given point is outside of the convex hull of the balls centers. It is shown that in this particular case the problem of finding the smallest ball centered in 𝐶0 which includes the intersection of balls is actually convex.