Given a convex polygon. How to find ( fast ) a point for which the maximum distance from vertices is the smallest. Here is told a way, but I can't prove it and it seems to be incorrect.
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | adamant | 161 |
2 | maomao90 | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 149 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
Given a convex polygon. How to find ( fast ) a point for which the maximum distance from vertices is the smallest. Here is told a way, but I can't prove it and it seems to be incorrect.
Name |
---|
This is an instance of the Smallest circle problem (this problem doesn't specify that the points have to form a convex polygon, but as the optimal algorithm for the general case runs in linear time I guess you can't do much better).
Megiddo proposed a deterministic algorithm to solve it in linear time (you can look it up if you want), but I particularly like this randomized approach (which is expected linear):