issing GH components and launching into a script but there's a time and a place for script.
Pure GH definitions are good because you don't need to understand script but some scripted solutions seem to run faster. I guess it depends on how good the script is! In my case it's probably quite basic but I'd scratched my head for weeks when I finally put my very basic VBScript skills to use and found it quite satisfying to do.
The original thread was about random cyclic / periodic functions and I got close to what I wanted with GH after taking on board David's advice and doing a bit of thinking for myself. There's probably a solution using the Expression component too.
You've followed the sidetrack from random functions to meshes and polysurfaces so give us a break if we want to look at some script, eh? :)
I tried to mesh the section curves using a few Series components to select the vertices of the section curve divisions and arrange them in a list of branches of 4 vertices that can be used to create a mesh face...
So, when you use DivideCurve on 100 section curves you get 100 branches of n points.
I tried to select {0;0} and {0;1} and {1;1} and {1;0} for the first mesh face
then {0;1} and {0;2} and {1;2} and {1;1}
then {0;2} and {0;3} and {1;3} and {1;2}
etc until {0;n-1} and {0;0} and {1;0} and {1;n-1}
That would give you vertices for quad mesh faces to fill the loop between the first and second section curves.
After that you need to do the same between the second and third section curves and so on until you do it for the last and first section curves to close the "loft"
You can do this by doing something along the lines of a Series of 0 to n-1 and plug that into the start parameter of a Series step 1 count 2 and then use that Series as the input to a List item
This isn't the whole solution, but you get the picture. It starts getting really complicated in terms of data structure to get the output of (n x 100) branches of 4 vertices (the right 4 vertices!) to plug into a Construct Mesh component but I'm sure it could be done (just not by me right now so I resorted to some script I'd done a while ago that does a similar thing only with triangles instead of quads)
Hopefully someone will do this in about 3 GH components and make me go "ahhhhh FFS!"…
Added by martyn hogg at 6:57pm on December 20, 2015
.ToNurbsCurve()).
2. Then you create a block instance out of it.
3. Then you define Planes at each random point (as the C# does already).
5. Then you define 2 transformations : one that does scale (in a "similar" way with the 2nd C#) and one that does PlaneToPlane (from blocks' "world" to the plane "world").
6. Then you call the block instance on duty and you apply these 2 for each random plane (a coordinate system in fact: term plane used in GH is highly unfortunate) that is derived as: surface.PointAt(thisRandomU, thatRandomV).
I hear you: what's the fuss with all that nonsense mister? Well ... let's say 100 times faster execution of the 2nd C#: is this good enough?
I'll provide this "pro" approach (a bit more complex than the very simple/primitive 2nd C#, mind) in the traditional V2 update (soon, maybe this weekend).
best, Peter
…
y you have a mesh with 100 vertices (points). The first one is at index 0, the second one at index 1, then 2, 3 etc. all the way to 99. A face might connect vertices 0, 1, 22 and 23.
You typically don't use this kind of low level method to create a mesh, though of course there's nothing stopping you. Most meshes are either the result of some operation on existing meshes, the approximate mesh of a surface/brep or based on one of the mesh primitives such as Plane, Box or Sphere.
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
Then I want to map it to a sinusoidal distribution curve without disturbing the boundaries. Right now I have to open the graph mapper type 100 and 200 for X, Y inputs
Is it possible to have a parametric input to graph mapper bounds X0, X1, Y0 , Y1 ? .
Because I need to put graph mapper inside a cluster.
Best
Shahrokh…
nto a max deviation from the original geometry of 0.015 (I don't know if this is acceptable) and speeds up the projection by approx 65% and the splitting by more than 80%.
Regarding the long times, it seems that after a certain amount of holes the solution time increases at a higher rate - for example cutting 100 holes takes about 1 seconds, while cutting 800 holes takes more than 2 minutes.
You could split the 30000 holes in smaller groups (using domains and sublists), calculate the resulting geometry, bake it and use it as the base geometry for the next cutting operation - it's a bit tedious but much more reliable IMO than having a computer working for days.
best,
Marco…
ent (for the final result).
in the picture they are 2 gray pixel. These should be green like the rest. Anyone know what could be the problem? (The gradient is set only between 0% and 100%)
many thanks in advance!
n.…