Tag Info

New answers tagged

0

I would not call this a that simple but here is now you can do it: Let's first have some notations (given the picture you provided): A = green dot; B = pink; C = Purple; D = Red Q = blue; P = the polygon defined by a set of segments or lines. So basically you want to know if any line QA , QB , QC , or QD intersects your polygon P The naive ...


1

You can create an algorithm based of edge intersection. The idea is to draw a line between the two points called a ray. This then acts as a line to test whether the polygons lines intersect. You can do this in pseudo-code: // Method in point: bool IsPointBehindPolygon( testPoint, polygon) { originPoint = this; ray = new Line(originPoint, ...



Top 50 recent answers are included