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!
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 163 |
| 2 | adamant | 149 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 135 |
| 7 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 132 |
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.