Hi guys, i'm trying solve this problem.
The resume is: given a set of points, print the smallest circle that cover all points.
I'm searching, but only find aproximate algorithms.
Somebody know a algoritm without aproximate?
Thanks for advice.
Hi guys, i'm trying solve this problem.
The resume is: given a set of points, print the smallest circle that cover all points.
I'm searching, but only find aproximate algorithms.
Somebody know a algoritm without aproximate?
Thanks for advice.
Hi, I believe that this can help you out. :D
this approach gets WA because fail in coordinates approximation :/
Exact algorithms are described in Smallest-circle problem.
Best wishes
On a side note see this problem too . A slightly modified version of smallest enclosing circle : https://www.codechef.com/problems/CHEFCIRC
You can use nested ternary search though it is O(nlogC^2)
Could you explain your solution in detailed please ? thanks in advance.