Given N points in the 2- D plane , find minimum radius of the circle which encloses atleast m points?
thanks in advance
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Given N points in the 2- D plane , find minimum radius of the circle which encloses atleast m points?
thanks in advance
Name |
---|
What is an algorithm for enclosing the maximum number of points in a 2-D plane with a fixed-radius circle? This can be solved in n*n*logn (see here)
Now to solve your problem all you need to do is to binary search over possible range of R to find the minimum R which encloses at least m points.
This problem was asked in recent codechef long challenge (click)
ok Thankyou sir