rankenstein all together as I wanted in the beginning, hehe nearly forgot it.
(Rotating every new branch 90° blabla), should be not too difficult.
Reagrding to your last comment, I see this not as exercise for something to be built. Just to learn the clash thing. Obviusily it would be ways nicer do it as you described but I know that is far away from what I can reach at the moment.
When you say "... locate the clash events (easy)." So just put in the Tree when no intersection happens.
Maybe later I can ask you to give an example of how to do this.
Below: image of SardineTree ready to get harvested
…
ie une section ronde quand je lui assigne la fonction pipe, pour ce qui est du réseau polaire peut tu m'en dire davantage pour arrivé a repliquer l'helice j'ai utilisé la fonction " rotate " a laquelle j'ai appliqué une fonction degré avec une expression X/360 et du coup j'oriente les courbe a 90 , 180 et 270 par exemple si j'ai 4 courbe. Mais peut être que ma logique n'est pas bonne et qu'il faut balayé sur une courbe et après répété la fonction le nombre de fois souhaité.
je joins un exemple en fichier joint de ce que j'ai fait pour l'instant
…
ying to create an adaptable canopy made up from a surface which has been divided in to a number of squares. lets say 5 x 5.
I want the canopy to respond by closing (rotating the squares) 90 degrees. when an attractor comes close to the square,
Is there a way to reference multiple squares without having to add a massive piece of script for every square.
Hope this is a clear question?
The Script is attached.…
ve I want to use.
I want to then divide the curve and paste in a few other components (diamonds in my case) that are placed perpendicular to the curve. To achieve this I'm using the Perpendicular Frames component to extract frames from the curve and then I orient the other geometry to these frames. This works fine, except for one issue I have which is that the middle frame generated by the PFrames component seems to be rotated 90 degrees from the other frames. Because of this the geometry I try to orient obviously also orients in the wrong direction.
Attached are two images that hopefully illustrate the problem, you can see that the middle frame has another direction in comparison with the rest. Why is this happening? It must have something to do with the initial curve and at one point I thought it might be because I used 'join curves' to create the curve from two other curves but when I tried it on another curve that I also extracted using Deconstruct Brep that wasn't joined, the same thing is happening. Does anyone maybe know what's happening here? Thanks!…
is we pumped some insulating foam into the mould to act as a further compression element to the initial blue rods. At this moment in time I am trying to create a grasshopper script to mirror this material behaviour
I have been playing around with the twist_frames script but it's not exactly what I want. In an ideal world I could create a relatively simple mesh and then have it tighten around the linear elements. This would mean that the initial model is made so that the mesh meets the points before the kangaroo is initialised.
Just to note. This image should be rotated 90 counter clockwise. The model tapers to the end because we weren't able to spray the foam to the bottom this should not be a concern for the script as that is a physical hurdle rather then a digital. Also, the model was hung thought out the process so was not in a state of tensile equilibrium
…
Added by Conor Scully at 6:26pm on November 25, 2014
direction.) these lines are important because they're all straight lines. The idea is then to have curved pieces going the opposite direction to form the lattice (doesn't have to be exactly 90 degrees right now).
So far, I haven't been having much luck with things like curve on surface or isotrim, and I'm a bit stuck. Even if someone had an idea for an approach, that would be a huge help. Here's where I get to before running into difficulties:
I've also highlighted two points on the straight pieces to show the approximate direction of where the curved connecting pieces would ideally go. I tried using those as uv points for a curve-on-surface, but with no luck!
Any help would be massively appreciated!…
m boundary for a much more fine-grained voronoi. So it may be similar to the 2D voronoi groups, but not really.
I managed to create the points within the geometry, and build a fine-grained voronoi diagram, but could not cut it down using SDiff.
Now I have a few questions:
1. Is there a better method to create the points? Because first generating thousands points in a bounding box and then throwing away 90% of them is quite time consuming and doesn't seem to be an elegant way.
2. Is there a good method to convert a mesh into a brep? Then I could use SDiff to get me a result (but I'm still not sure if that is exactly what I want)
3. Is there overall a better/smarter approach to the problem?
Thank you very much for your help :)
…
late the angles between each.
My script so far isThe error occurs in line 90+91 I dont know why this is happening they should all be vectors since they are stored in a Vector3d list.
So if anybody could enlighten would be really appreciated.
Thanks and nice monday!…
divides itself in 3.
Parameters: Length and Angle (the middle one is fixed, the other two vary in angle).
Goal: The circles need to be tangent at all times. So if you reduce the radius, the angle would close in order to bring the circles close together, till they are tangent.
When you increase the radius, the angle opens, up to a maximum of 90 degrees. From this point onward, the only parameter that can make the circles still be tangent is the length of the lines, which should increase in order to keep the circles tangent.
Thanks for any help
Shynn
…
of Space, 1984) and specified in (Turner A. , “Depthmap: A Program to Perform Visibility Graph Analysis, 2007), intuitively describe the difficulty of getting to other spaces from a certain space. In other words, the higher the entropy value, the more difficult it is to reach other spaces from that space and vice-versa. We compute the spatial entropy of the node as using the point depth set:
(11)
“The term is the maximum depth from vertex and is the frequency of point depth *d* from the vertex” (ibid). Technically, we compute it using the function below, which itself uses some outputs and by-products from previous calculations:
Algorithm 4: Entropy Computation
Given the graph (adjacency lists), Depths as List of List of integer, DepthMap as Dictionary of integer
Initialize Entropies as List(double)
For node as integer in range [0, |V|)
integer How_Many_of_D=0
double S_node=0
For depth as integer in range [1, Depths[node].Max()]
How_Many_of_D=DepthMap.Branch[(node,depth)].Count
double frequency= How_Many_of_D/|V|
S_node = S_node - frequency * Math.Log(frequency, 2)
Next
Entropies [node] = S_node
Next
…