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.
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | pajenegod | 145 |
9 | SecondThread | 145 |
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.
Name |
---|
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.