consider the following 5 by 2 matrix that contains the indices of the nodes of a polygon:
N = [...
each row in N contains the node indices of the polygon's edges, but they are not ordered. For example, the first edge of the polygon connects the nodes number 5 and 12 and the 4th edge connects nodes number 12 and 8.
I am looking for the closed loop in this matrix without any further considerations,i.e. the starting point is not important nor is the direction of the path (clockwise or counterclockwise).
For N, a good possible answer is:
Also any cyclic permutation of p and its fliped version are acceptable.
My actual problem involves lots of these polygons, but non of them has more than 10 edges.
I have tried for loops for each polygon, but it turns out to be time consuming. Is there any better way to do so, timewisely? what would be the best approach to this problem?