I am wondering how the even-odd algorithm works for identifying a point in a complex polygon. 

What I know right now is that it will do the horizontal search from most left to the point and count the number of edges touched.

However, what happens if the edges touched is in an intersection of 2 edges? how does it count? 

Example of polygons: 

[![Examples of polygons](https://i.stack.imgur.com/VDM1H.png)](https://i.stack.imgur.com/VDM1H.png)