perations) my branches don't seem to be in the same order, that means that i would need to loft {0} with {1}, {1} with {2},...{8} with {0}!is there a way how i can reorder the branches in a way that i can finally loft as i described in the beginning:
{0} with {0}
{1] with {1}
...
{9] with {9}
thanks in advance!…
Dimitris,
You need to set your occupancy from 0 to 9 (say it is 1), then from 9:01 (or 10) to 17:59 set it to 0 and from 18 to 24 set it back to 1 again. This is how you set schedules in E+.
-A.
Nothing spectacular, I needed to find all integer pairs for which n/k with n and k being in between 1 and 100 yields a two decimal result the first of which equals 9.
Added by David Rutten at 4:10am on September 27, 2015
ine between: item 1 {0;0} treeA and {0;0;1} treeB
line between: item 2 {0;0} treeA and {0;0;2} treeB
line between: item 0 {0;1} treeA and {0;0;0} treeB
line between: item 1 {0;1} treeA and {0;0;1} treeB
line between: item 2 {0;1} treeA and {0;0;2} treeB
I solved the problem in a static way: I banged and grafted every branch of the treeA. Then I put two line components to draw two lines groups between the treeA branches and the treeB.
That's not what I'm looking for.
What I need is that if in the treeA the branches number changes then the algorithm draws lines automatically.
I attached the gha. file.
Thanks for your help.…