with 10 ordered curves. These in turn are to be interated in a move slider( 10 vectors).
As I plug these 3 new grafts in the move slider though, these curves all iterated 10 times (100 curves total) instead of being lifted one at a time.
…
he same order of the list. for example i have a list with 4 different lenght of curve like this:
0= 10
1= 12
2= 8 (minimum)
3= 17 (maximum)
and wont to make a ranking that the longest curve gets the value 4 and the smallest the value 1, like this
0= 2
1= 3
2= 1
3= 4
i tried the sort list function, but it dosn`t work
can anybody help me!
thx a lot…
hoose: Properties > Security Tab > ALL APPLICATION PACKAGES4) Click on "Edit" and then check all checkboxes in the "Allow" column of the "Permission for ALL APPLICATION PACKAGES" window!Attached below is a 1.jpg screenshot of mentioned checkboxes. Screenshot is made for Windows 10.5) Repeat step "4" for all other groups!!! Check the attached screenshot 2.jpg below to see which groups.6) Repeat steps "3", "4", "5" on the following folder and file as well (in case you have "MapWinGIS" installed in: "C:\Program Files\MapWinGIS" of course):
"C:\Program Files\MapWinGIS\gdal-data" "C:\Program Files\MapWinGIS\gdal-data\osmconf.ini"
7) Right-click on "Rhino 5/Rhino 6" icon and then choose: "Run as administrator".
If you have no issues after this, then close the Rhino and Grasshopper and try to run it 'normally', without the right-click on it and "Run as administrator".…
Added by djordje to Gismo at 2:08am on October 13, 2018
d these divided points need to be moved a multiple number of times each based on a series of values that have been produced for each point, so each branch of curve points needs to be fed into each of multiple branches of the move values that have been produced,
lets say I have 3 branches of divided curves and 4 branches of move values, each of the 3 branches of divided curves needs to apply the 4 branches of move values, to make it simpler I simplified both the branches of divided curved and the branches of move values for each point
divided curves need to each map onto all the multiple move values
Divided Curves move values
{0} N=10 (no. of division points) {0} N=10
{1} N=10 {1} N=10
{2} N=10 {2} N=10
{3} N=10
The Grasshopper file and Rhino file attached both show what Im trying to achieve but Im sure there’s a simpler way of telling the Path mapper to duplicate those branches than what I have, or perhaps I’m going about this the wrong way…I want to figure this out as I plan to base future work on this method and Im sure there are simpler ways of doing this…
1
condition: largest number<max length
then the packing would look something like this:
1 |4 |5 |7 |2
9 |6 |5 |3 |2
|5
|1
sums|10|10|10|10|10 => 100% efficiency
And the algorithm is:
1.Place first number(x=1)
2.Calculate the rest(R) in this row(10-1=9)
3.Search for closest x <= than R
3.1 If x=R -> place that number -> end of cycle
3.2 If x<=R -> place that number -> return to 2.
3.3 If x=null -> end of cycle
Something like this.
Can this be classified as brute force?
…
Added by Artyom Maxim at 11:08am on March 19, 2013
as follows.
We have a grid which consists of a collection of columns, where each column consists of a list of points. You said flattening is out of the question, so we need to cull items from each list individually.
Let's say our culling pattern is KDDDKDD (repeat as needed). K = Keep, D = Ditch. If a column contains 18 points, the pattern needs to be repeated until it is 18 items long. In this case:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
K D D D K D D K D D D K D D K D D D
We can now cull each column, but they will all be culled in the same way. By shifting the pattern one more index for each column, we can cycle the culling.
The fix incidentally is to Shift the pattern PRIOR to repeating it. Then it works as expected:
--
David Rutten
david@mcneel.com
Tirol, Austria…
Added by David Rutten at 2:49pm on October 2, 2013
hat position you would like in order:
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
You still must show up on time and you still must stay and work on your project during the duration of class.
See you all next week, I hope I won't still have this cough!
-Joseph Iwaskiw…
of the intersection points is giving me some problem.
Here is the process i've done to come up with the grid (best viewing the image!):
1. create a base rectangular polygon;
2. find the diagonals and subdivide these, let's say in 10 points;
3. connect the points of one diagonal to the adjacent one in this order:
1 to 9
2 to 8
3 to 7
4 to 6
5 to 5
6 to 4
7 to 3
8 to 2
9 to 1
4. find the intersection points on every line drawn.
Now I would like to create individual surfaces connecting all the points that form the vertices of the polygons, but I cannot find out how...
Can somebody help me?
Thanks so much!…