urs x 365 days ), and with modulus in the screenshot above, i could manage to do for every hour. but sometimes in my definition, i have a range from 1 to 35040, which is 365 x 24 x 4 ( 4 here defines every 15 minutes), on other word, when the number is one, then i have 01:00 O'Clock, when the number is 2 then i have 01:15 O'clock, when the number is 3 then i have 01:30 O'Clock...etc , so when the number is 97, which is the next day ( and after the number 96 which is equal 24 hours x 4), then I should have again 01:00 O'Clock.
I hope my idea is clear, thanks in advance!
Nassif…
by its own tangent vector on the curve... and this happens to the last item. Here's the algorithm:
B0 ----> B1
B1 ----> B2
B2 ----> B3
B3 ----> B4
...
…
nt B2[i] so B1[i]<=0 means no new connections allowed for point i ,so point i is deleted from B1, B2 updated accordingly.
Initialization:
B1: max number of connections x number of points
B2: all the points
B3: nothing (well null or something, need to create the branch)
Algo:
Get first point in B2, get his allowed number of connections N in B1, find N closest points in B2, create lines in B3, update B2 accordingly. Erase points with max connections (including the first point)
Next
Stop when no points available
At end of loop, B3 stores the created lines.
…