the number of desired lines.
Example, if I have a height of 100 lines, lines 1,2, 3 ... 50.52, 54.57 ... will be blue and 100.99, 98 ... 51.49, 47.43 ... will be red.
maybe the image is more helpful
But if I chose a lot of lignes, to didn't see the lignes, visually.
More something like that!
…
e modules in your solution are rather decorative (too small for any shading function worth the name): you need something big. But making that big a stunning design ... that's another animal.
3. Arches definitions ARE not correct (arches vary during the retraction): you need a totally different approach.
4. As I said, I could do it rather easily by replacing all components with a single C# (plus the correct arch design, plus detailed linkages ... plus using blocks in an assembly/component fashion for the arches, BP joins, pivoting joins et all) but it could be 100% useless to you since you don't speak the language.
Moral: long is the path (and hilly)…
ng, it does go to the very first point in the next row,
Screen%20Shot%202012-04-21%20at%202.41.27%20PM.png;
I want it to accept that there is no more neighbors and agree on 2 or 3 neighbors only.
from processing, I know it might be something like that
for(int i = 0; i<x_count(); i++);
else();
(not 100% sure even :((( )
GH and screen shots attached!
Thanks for help;
bibo …
u can display:
1. All angles
2. Angles that are smaller than a number(chose number from the CONTROLS group)
3. Only the angles around a specific node (chose node from the CONTROLS group)
Can you please explain a little better what you are trying to do?
Do you want to create pipes around all the mesh edges?
If so, what is the rule for the pipe's radius?
If it starts or ends on a node that has at least one angle<50 then its radius is 100?
And if not?…
Added by nikos tzar at 10:10am on September 8, 2014
hs (sequenced points) in initially one of two lattice structures. Output only the paths that meet the path requirements.
Path requirement (GH Inputs):
1. Number of path points: 1..N (N could and up being up to 100? (Massive calculations, realistic numbers in the up to 30 range)
2. Symmetry requirement: 0 (none), 2,3,4,5,6 fold (path sections repeat)
3. Closed path boolean: default true (output only paths where first point is last point)
4. Lattice selection: cubic body centered, cubic face centered
5. Straight path section boolean: default false. Blocking the path from going straight or allowing it to go straight. Going backwards should always be blocked.
Outputs:
1. List of unique points in sequence for path in the lattice. grouped by individual path
On implementation:
1. generate all paths and eliminate paths with duplicate points (self intersecting lines)
2. eliminate paths that don't meet closed boolean (first point not equal to last point)
3. eliminate paths that don't meet symmetry variable
for symmetry paths (symmetry not equal to 0) only number of points divided by symmetry has to be calculated. each section can be repeated the number of times of the symmetry.
For closed paths, a distance from the staring point could be maintained that could stop the generating of paths that can't make it home.
Any thoughts would be greatly appreciated!…
Added by Anton Bakker at 10:38pm on December 29, 2013
FF can produce different results each time it is run. See images below, these were created with the same parameters, I just clicked on "recompute". I would have thought that if left iterating long enough, it would eventually converge on the same optimal solution every time. Regarding the symmetry, I would imagine that even taking away 3 elements at a time, given that it can add elements back in at any stage, it should still arrive at a stable, symmetrical solution...
It would be fantastic if you could discuss these issues with your colleagues next week and keep me posted!
I have also read the FFF section of the manual. It is a little hard to understand exactly what each of the inputs means. Would it be possible to illustrate them with a numerical example? eg "a truss with 100 members, and overdrive set to 1.4 will take away x members each iteration... etc etc"
Thanks for you help,
Steven…
.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
…
ate the "base" ... load Rhino file fist.
2. This greatly reduced demo creates a Del Mesh "in real-time" (it's a very complex project that I'm after these days: 10 C# scripts work together to do ... something, he he) AND finds convex hull points as well, So it works "twice" but still is fast. In fact it's about 15 times faster than the very same thing that I did with Generative Components.
3. Again: NOT for your case but good fun (I believe). Obviously doing this for a couple of surfaces of yours ... it could yield also a real-time solution.…
a part of it,,,, plz find the file attached and tell me if there's a problem i can't recognize ?
the energy plus Icon tells me to update honey bee & I updated it but no results .
for the simulation results I need for my study :
- air temperature in side the building
- thermal comfort analysis
In 3 cases " when the kinetic facade is closed , 50% open & 100% open " then I need to make optimization to get the optimum movement of the facade .
so I need to know what's the problem with my file !!! and if there are advises for the next steps of my study will be great .
and I have a question , honey bee can deal with windows , but what about doors ? how to have a correct results with no doors in the building ?
thank you in advance
Mona rezq
…
of rectangles (ANY set) in ANY rotation/size etc AND a set of profiles (ANY profile) in a SEPARATE Rhino file: Sizes MUST comply with the ones used in V2 (i.e. stuff not in Planet Mars 1M miles from origin etc etc). Profiles MUST been oriented like the one in V2 (otherwise: Armageddon - I mean I could easily handle with any plane used for the profile ... but why bother?)
3. Describe ANY imaginable additional desire of yours with regard the frames. I mean ANY (just a small demo of the Dark Side). Like putting 3d solid flowers at the corners or flying pigs or anything.
waiting for the frames (the rectangles, that is)
PS: This is a very simple implementation of the Dark Side (complexity 1 out of 100, so to speak).…