g these times itself). If it works on selection alone, it would probably implement faster.
Theoretically, does this mean the total solving time of the definition is the 'chain of components' that takes the longest time? In the picture above, it would be the chain consisting 'point-curve-divideDistance'?
Because that still adds up only to 97%, I am assuming the Point and Slider component start solving in parallel, and the two Divide components also start solving in parallel?…
CA, DA, DC)Two of those diagonal lengths are obviously redundant but they allow you to simply shift the array to get at different rotational permutations. This makes the search for the nearest mean a bit more straightforward since, in the context of panel clustering, you'd need to consider all rotational permutations of each one.…
Added by David Reeves at 5:26am on November 9, 2014
thing deeper? ".. these and then some more.
As this simple search in the source code will tell you, right now at least Honeybee is meant to be run on Windows. There is a cross-platform version already in the works which will run seamlessly across different platforms.
Sarith
(I don't know if what I said above applies to Ladybug as well as I am not involved in that project).…
. The rules to dispatch the lines are the next:
I start with a list that alternate true/false; like that: true, false, true, false.
If the angles between those lines are greater than 89° I want to inverse the next part of the list:
True, False, True, False, True, False,...
become
True, False, [>89°] False, True, False, True, [>89°] True, False,...
I managed to create a true false list, to check for the greater than 89° angle, to separate the lines relatively to the angles, but I don't know how to inverse part of the list at certain index.
(In the picture, I have written 90° but it should be 89°, I check for greater than 89° and not equal to 90° because in the real rhino model, the lines won't be exactly orthogonal)
If you have another idea to to reach the same result, it's also okay, I tried to find rules to solve the problems, but I may have overlooked other solutions !
And if there is some part of the patch that are correct but there is easier solution, I would love to learn as I am still new to grasshopper.
Thanks for taking the time to read. :)
…
t it is rounded to 25, 100, 75. I've figured out the rounding portion, but when I plug the resulting list back into the custom preview, it doesn't recognize the data. I'm guessing it is because my rounded list is in curly brackets, whereas the unrounded data straight from the image sampler is not. How can I process this to remove the curly brackets?
Thanks,
Ryan
…
Added by Ryan Dirks at 5:20pm on September 18, 2014
How to divide the curve not equally?For example, I want to divide a curve into 5 segments, in different intervals(use range command or random command)?
nt B2[i] so B1[i]<=0 means no new connections allowed for point i ,so point i is deleted from B1, B2 updated accordingly.
Initialization:
B1: max number of connections x number of points
B2: all the points
B3: nothing (well null or something, need to create the branch)
Algo:
Get first point in B2, get his allowed number of connections N in B1, find N closest points in B2, create lines in B3, update B2 accordingly. Erase points with max connections (including the first point)
Next
Stop when no points available
At end of loop, B3 stores the created lines.
…
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