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
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | pajenegod | 145 |
9 | Petr | 145 |
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
Name |
---|
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