1:
{0} N=5
{1} N=6
and a tree 2:
{0;0} N=1
{0;1} N=1
...
{0;18} N=1
{1;0} N=1
{1;1} N=1
...
{1;19} N=1
I want to basically modify Tree 1 in order to get
{0;0} N=5
{0;1} N=5
...
{0;18} N=5
{1;0} N=6
{1;1} N=6
...
{1;19} N=6
which is the Tree 1 with the structure of Tree 2 and the items of Tree 1 {0} branch populated at each {0;*} branch of Tree 2 and the items of Tree 1 {1} branch populated at each {1;*} branch of Tree 2.
…
another comma separated txt file. I know how to import points (function Import coordinates), but I dont know how to connect them by lines if the only information I have about lines is the list of point numbers which should be connected. The txt file with point coordinates looks like:
-18,-36,-1000-18,-34,-19.728-18,-32,-17.603-18,-30,-15.372-18,-28,-13.121
...
And the txt file with line connections looks like:
1,22,33,44,55,6
...
Which means that I want to connect point 1 with point 2, point 2 with point 3 etc...
Both txt files are attached, thank you for the answer...…
666} means: 6th main branch then the 66th "subbranch" then the 666th "subbranch". See how the history of variants in the Interactive example grows and grows when you add variants (or shrinks if you delete some).
4. A Matrix can been viewed as a single dimension tree. Ditto the other thing.…
our graphic card.
Try this: right click on the desktop, properties, find advanced somewhere and drop 1,2 points down the slider of hardware acceleration.
Have a look at this forum, it is about vray-rhino's plug but you might find something interesting there
http://software.asgvis.com/index.php?option=com_content&view=article&id=209%3Afaq&catid=102%3Asupsol&Itemid=18
good luck…
e
7. True
8. True <-- this one
9. True
10. False
11. True
12. False
13. True
14. True <-- this one
15. True
16. False
17. True
18. False
19. True
20. True <-- this one
21. True
22. False
23. True
24. False
25. True
26. True <-- this one
27. True
28. False
29. True
30. False
31. True
32. True <-- this one
33. True
Any idea how I can solve this?
Thanks!…
ng (It's a bit similar to the Knapsack problem):
I have a Variable --> XandI Have fix numbers (can we call "pieces") 9,12,15,18
I'd like to reach the X, with the summing of these numbers and using the minimum pieces ,it can't be lower than X, but it can be higher, maximum with 3.After this it has to found the most optimal combination which mostly use the same pieces
E.G.
X=98
The wrong solution is like = 1pcs of 18 = 9pcs of 9
Sum of pieces are 10
OR
= 3pcs of 18 = 1pcs of 15 = 1pcs of 12 = 2pcs of 9
Sum of pieces are 7
The right solution in this case = 5pcs of 18 = 1pcs of 9
(5*18)+(1*9)=99 it's good beacuse it's over with maximum 3 and uses the minimum pieces
Then it sends to a list like18 : 5pcs15 : 0pcs12 : 0pcs9 : 1pcsCan somebody help me ? Or is it possible to make this ?
Thank you…
Added by Petrik Kollár at 1:09am on November 10, 2017