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 | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 161 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | nor | 155 |
7 | adamant | 155 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
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.