Given vertices specified by the vectors xv and yv, and a single point specified by the numbers X and Y, return "true" if the point lies inside (or on the boundary) of the polygon defined by the vertices.
Example:
% The specified point is the center of the unit square: xv = [0 1 1 0]; yv = [0 0 1 1]; X = 0.5; Y = 0.5;
inside(xv,yv,X,Y) -----> true
The test suit only tests points that are inside or outside but not on the boundary of the polygon
Cyclist, this was a pretty tough problem to solve without resorting to Googling a solution or something similar. I ended up with a function that will work for any n-sided polygon. Thanks for the weekend challenge.
Maybe, thinking this problem in topology aspect is useful.
132 Solvers
112 Solvers
103 Solvers
Magic is simple (for beginners)
691 Solvers
Back to basics - mean of corner elements of a matrix
214 Solvers