find a point such that the maximum distance to any point in a set of points P is minimized
2d, algorithm, graph-theory
Solution
This is the smallest circle problem.
Problem
Given a set of points in 2d-space P, where Pi = (Xi, Yi), I need to find a target point T such that the maximum distance to any Pi is minimized. T does not need to exist in P, and can be defined arbitrarily Is there an algorithm I can use for this?