Find the point with minimum max distance to any point in a set

Question

Say I have a set of points on a 2d plane, how do I find the point(s) where the maximum euclidian distance to any of the points in the set is minimized?

score 7 · Answer 1 · edited Mar 04 '13 at 02:48

7

This is the smallest enclosing circle problem, and can be solved in linear time. Also, these slides describe a randomized algorithm that runs in expected linear time.

edited Mar 04 '13 at 02:48

Juho

22,554
7
62
115

answered Mar 04 '13 at 01:58

Sasho Nikolov

2,537
16
20

Find the point with minimum max distance to any point in a set

1 Answers1

Linked