Hi, is there a function or an efficient way to find the overlap between two intervals represented in vectors. for example for a=[0 90 180 270]; and b=[26,180,270]; it should find the following overlaps and return the indices
26,90 (2,1) 90,180 (2,2) 180,270 (3,3) or (4,2) and the edges as well (as though the intervals are cyclic) 270,0 (1,4) 0,26 (1,1)
No products are associated with this question.
If boundaries are integer, a solution can built based on CUMSUM for building interval IDs and DIFF or UNIQUE for finding boundaries and IDs. I can develop this further if you are interested.
However, if all you have to do is to generate the list of intervals, without really caring for interval IDs, why couldn't you just go for something simpler, like:
>> bnd = unique([a, b]) ; >> if bnd(end) < 360, bnd = [bnd, bnd(1)] ; end >> int = [bnd(1:end-1); bnd(2:end)] int = 0 26 90 180 270 26 90 180 270 0
Your question is a little ambiguous but her is something you can use
To see where the arrays overlap
C = 180.00 270.00 ia = 3.00 4.00 ib = 2.00 3.00