| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
https://cp-algorithms.com/geometry/point-in-convex-polygon.html
In above link, the code for checking whether a point is inside a convex polygon is flawed. I tested on some examples, it gave wrong answer.
Can someone point out the mistake and thus request the author to correct it!
This blog was actually helpful.
I'm sorry but I upvoted you
Could you provide the test you were testing with?
One of the tests is:
Polygon points: (1,1) (6,2) (2,5)
Query point: (0,0)
In the function
prepare, the code moves the polygon by-points[0], and in the codepointInConvexPolygon, it doesn't move the point being queries. So I think if you wanna check the point (0, 0), you're supposed to query(0, 0)-(1, 1)=(-1, -1). And querying(-1, -1)does return 0. I think it's just a bad documentation / weird formating of the function on their part.