Can anyone explain the solution for this problem 102014F - Directional Resemblance ?
The problem basically says:
We are given N vectors in 3D and we want to find 2 vectors such that the angle between them is minimum.
# | User | Rating |
---|---|---|
1 | tourist | 3778 |
2 | Benq | 3592 |
3 | ecnerwala | 3521 |
4 | Um_nik | 3423 |
5 | jiangly | 3375 |
6 | Petr | 3342 |
7 | Radewoosh | 3337 |
8 | scott_wu | 3313 |
9 | maroonrk | 3265 |
10 | yosupo | 3259 |
# | User | Contrib. |
---|---|---|
1 | 1-gon | 203 |
2 | Errichto | 202 |
3 | rng_58 | 194 |
3 | SecondThread | 194 |
5 | awoo | 187 |
6 | vovuh | 183 |
7 | Um_nik | 182 |
8 | antontrygubO_o | 177 |
9 | Ashishgup | 175 |
10 | -is-this-fft- | 171 |
Minimum Angle Between 2 vectors from a given set of vectors (3D)
Can anyone explain the solution for this problem 102014F - Directional Resemblance ?
The problem basically says:
We are given N vectors in 3D and we want to find 2 vectors such that the angle between them is minimum.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 |
![]() |
ZeyadKhattab | 2019-09-13 09:34:00 | 15 | ||
en1 |
![]() |
ZeyadKhattab | 2019-09-11 21:34:52 | 259 | Initial revision (published) |
Name |
---|