Hey! I discovered a type of problems where we have for example n points and we want to discover the convex hull (the border) using some of those points, but after that calculate the area of the smallest rectangle in which that convex hull can lie inside. I saw that we can rotate the convex hull with some degrees, but I didn't understand it very well. Can anybody give me more details about how to rotate a convex hull with sin and cos, some links eventually. Thanks!
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/22/2024 17:02:58 (i1).
Desktop version, switch to mobile version.
Supported by
Maybe this should work: For each edge of the convex hull, rotate it so that the edge becomes parallel to x-axis, then draw rectangle with leftmost, rightmost, topmost point and the edge. For the rotation see this: https://vlecomte.github.io/cp-geo.pdf#subsection.2.2.3
Why rectangle with the smallest area will always have an edge parallel to an edge of convex hull?
problem on wiki (see references)
another proof
paper with algorithm
Thank you! This helped me
Hi. Could you please post some problems related to this from online judges?