Clear questions and runnable code get the best and fastest answer 

PerlMonks 
comment on 
( #3333=superdoc: print w/replies, xml )  Need Help?? 
Its not just for fun that most game programmers work strictly in triangles.. problems such as the one you mentioning becomes so much faster to calculate... Simple solution: Make sure you are only dealing with triangles.. create a static point for each triangle, which you know is within it.. now make a line from that point to your point, check if it intersects with any of the lines in your triangle... if true, its outside, false, inside. Most general solution: I believe this was allready mentioned, but create a line between your point and any point which you know is outside of the polygon.. now count the number of intersections between this line, and edges in your polygon.. if its odd, your point is inside, otherwise outside.. (note: do not count intersections with edges, just ignore them... and this solution does not only work with triangles, but any polygon) Alternative solution: This one will also only work with triangles.. project your point onto two of the edges in the polygon. Yous should now have two fractions t1 and t2 telling you where your point projected onto the two edges.. if both t1 and t2 are between 0 and 1, and t1+t2<1 then your point lies within.. Anyways, have fun... if you need more solutions, search for pages about the nonzero winding number rule... I'm too tired to explain it now, but it should be easy to find a good page on it... (Note: this method will also work well with polygons that intersect with temselves to generate hollow areas within.. ) In reply to Re: Points, Lines. Polygons OO my
by kapper

