Search found 1 match

by dynamical
Sun Jul 19, 2009 7:20 pm
Forum: Algorithms
Topic: Minimal circle
Replies: 2
Views: 2538

Re: Minimal circle

There is a similar problem in CEOI 2006. (ANTENNA)
The solution is using binary search and sweeping, which gives the time complexity O(N^2 log N * log T).
(T is the maximum possible radius to cover all the points.)

Go to advanced search