I learnt Ray casting algorithm.I found on net. But I can't understand Winding number algorithm. Please somebody explain this algorithm or give example code(C or C++).
Thank you for everthing.
I'm so sorry for language mistakes
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 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 | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
I learnt Ray casting algorithm.I found on net. But I can't understand Winding number algorithm. Please somebody explain this algorithm or give example code(C or C++).
Thank you for everthing.
I'm so sorry for language mistakes
| Название |
|---|



Dear kerem, please clearly explain what do you mean with Ray casting or Winding number. I dont remember such thing from last year. What problem do you use them for ?
Ray casting algorithm is a method to determine whether a point lies inside a simple polygon or not. The method is to cast a ray from the point in some direction and count the number of sides of the polygon that intersect with the ray; if the count is odd, then it's inside, otherwise it's outside.
Assuming this means the problem is "determine whether a point lies in a polygon or not", the "winding number algorithm" is probably to compute the winding number of the polygon around the point; if it's 0, then the point is outside, otherwise it's inside.
The question is thus "how to implement this winding number algorithm".
Thanks Ivan
Thanks Keren