ts will basically be a set of different ellipses:{a1, a2, b1, b2} (with different properties) From that i want to create random Lists of let’s say 15 items (ellipses) Something like that {a1, b2, b1, a1, a2, b1, b1, a2, a1, b1, b2, a1, b2, a1, a1}. But I want to be able to create some constrains. So for example if I have a1 I will be able to have next a2 or b1 but not to b2. I am not sure if this is possible in grasshopper and i was messing around with some logic components but without any luck.
Any help will be greatly appreciated.
…
m b1 As Brep = Nothing
If (heights(b) > heights(b+1)) Then
b0 = breps(b+1)
b1 = breps(b)
Else
b0 = breps(b)
b1 = breps(b+1)
End If
Dim bDiff As Brep() = Brep.CreateBooleanDifference(b0, b1, 0.1)
If (bDiff IsNot Nothing) AndAlso (bDiff.Length > 0) Then
breps(b) = bDiff(0)
End If
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
Added by David Rutten at 7:32am on October 16, 2012
blinds be (B1,B2..B5). Then the geometry for the five iterations will be ((A+B1), (A+B2)...(A+B5)).
And assume that you are measuring illuminance at four points inside the room (x1,x2,x3,x4) and one point outside the room(y1).
The way Daysim works ( and should work as per the best of my understanding) is that for each setting of the blind (ie. B1,B2,..B5), a separate value of (x1,x2,x3,x4) gets calculated through the Daylight Coefficient Method. So let's say you have illuminance thresholds of (p,q,r,s,t) corresponding to (B1,B2,..B5). What the shade-control algorithm does is that it compares the illuminance at y1 with your threshold of (p,q,..t) and then chooses a value of (x1,x,2,x3,x4) on basis of that. So, when we repeat this process for (365x24=)8760 hours , we end up with a value of a shade setting for each hour which was set on basis of your threshold illuminance values.
I would have gladly answered your question on HB itself, however, I usually work with Daysim directly through commandline.
(BTW, if you are interested in reading more about Daysim google Christoph Reinhart's dissertation on the subject, along with some papers by Zack Rogers).…
omponent that increases in the x-axis (example below).
A1 A2 A3 A4 A5 etc...B1 B2 B3 B4 B5 etc...C1 C2 C3 C4 C5 etc...D1 D2 D3 D4 D5 etc...
This is as far as I've gotten:
I have collected my points on the grid into a "List Length" component and input that into a "Series" which input into a "Function" with the expression Format("A{0}",x). The result labeling resembles the example below.
A1 A2 A3 A4 A5
A6 A7 A8 A9 A10
A11 A12 A13 A14 A15 etc...
Any help is appreciated.
Thank you in advance.…
by its own tangent vector on the curve... and this happens to the last item. Here's the algorithm:
B0 ----> B1
B1 ----> B2
B2 ----> B3
B3 ----> B4
...
…
gone with the wind topic: since this is utterly Academic the main issue here is to oversimplify LBS (in real life: a collection of columns/beams/slabs/X members + tube frame rigid members (shafts/elevators/cats/dogs)). Reason is that if we use the real "solids" (turned into meshes) as the "node" pool for the hinges required ... only HAL 9000 could solve it in "real-time" (for instance an E5 Xeon 1630 v3 takes ... several minutes). And this is ... er ... challenging I must say. This is a typical case where "simplifying" means "stupidity" almost instantly.
Spam on:
where's my collection of "bend-a-truss-that-looks-like-a-tower" K1 demo defs? Is in this workstation or in another? (blame Alzheimer).
Spam off.
More soon.…
dro). The quality of the driver is also critical: hard to imagine NVidia working overnight to fix "some" driver bugs due to requests from gamers. Game cards are notoriously bad in dual monitor configurations.
3. A zillion of cores (triumph of marketing VS common sense) divided by the given clock rate ... gives you just ONE poor old core (Rhino/gh are single-threaded apps) that tries to do the job.
4. Single Xeon E5 2xxx V3 (the higher the clock the LESS the cores = better) would be my recommendation. ECC fast memory is also a must.
PS: Find a friend who operates a "loaded" H/P Z840 and test your defs.
…