1
\$\begingroup\$

I want to check in an shape, wether an point is in it or not. The shape is descriped with one Array of float vectors. The vectors are added in clock direction. The first I can check very easy, the second too, but the third is more difficult. How I can calculate this ? How this category is in math named, so that I can google ? enter image description here

\$\endgroup\$
1
  • \$\begingroup\$ Search for: point and convex polygon intersection. You will do a series of plane tests to find a distance of point to plane, for each plane of the polygon. \$\endgroup\$
    – RandyGaul
    Commented Dec 17, 2013 at 18:33

1 Answer 1

1
\$\begingroup\$

This is called point in polygon. You can find different kinds of algorithms depending on whether your polygons are convex or concave.

\$\endgroup\$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .