A closed polygon may be described by an N x 2 array of nodes, where the last node and the first node are the same. Each row of the array is a 2-element vector giving the x and y coordinates of a node. The polygon is described by straight-line segments that go from node to node.
In this problem, we provide you with a polygon p of this type, and with a number of points r, each having an x and y coordinate. You are to determine whether each point falls inside or outside the polygon. If the point is inside the polygon, return the value 1. If outside, return the value 0.
HINT: One way to solve this is to find a point 'p_test' that is outside of the polygon, and then to count the number of times that a line from 'r' to 'p_test' crosses the sides of the polygon.
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers35
Suggested Problems
-
Sum of first n terms of a harmonic progression
521 Solvers
-
Make a random, non-repeating vector.
11754 Solvers
-
Simple equation: Annual salary
4269 Solvers
-
Remove element(s) from cell array
2111 Solvers
-
Back to basics - mean of corner elements of a matrix
467 Solvers
More from this Author2
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
There is no input for the corresponding p variable?
For those wondering the same as me, defining the same/global p for all the test suites initially is somehow not visible in the test suite. You can now check the value from test case #1.