We have set of intervals [theta,-theta] . I want to find out the optimal value of theta [-180,180] which lies in the maximum no of intervals . Value of theta can be float . Can you please help me find the way to find out the optimal theta.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
We have set of intervals [theta,-theta] . I want to find out the optimal value of theta [-180,180] which lies in the maximum no of intervals . Value of theta can be float . Can you please help me find the way to find out the optimal theta.
Name |
---|
Auto comment: topic has been updated by selfcompiler (previous revision, new revision, compare).
Got the Answer
Sort the interval start and end values into a single list with a corresponding value for 'S' or 'E' for each one.
Scan the list, when you hit an S increment a counter, when you hit an E decrement a counter. If the counter is higher than the highest value seen so far remember the S and E values for that segment.
For the wrap-around case, simply split each interval that wraps (i.e. angle2 < angle1) into two pieces, one either side of zero. Add [angle1,360] and [0,angle2] as new intervals into the starting set.