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
...
…
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?…
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).…