ength is applied to particle b, and the same vector multiplied by -2*BendStrength is applied to a and c
Hope that helps. I was thinking of changing this input slightly for the next Kangaroo release, because I realize it can be a pain if you want bending stiffness of a curve to be independent of the number of points used, but I'll make sure to clarify any changes when I do update this.
…
t BBox will then be mapped relative to the UVW space of that box to the new target boxes.
Where your definition is slipping up is the data matching aspect of GH. You have two lists (that count). One list contains 100 items of target boxes and the other contains 2 items of geometry. GH defaults to the Longest List data matching
List A --> List B
Target Box A0 --> Cuboid
Target Box A1 --> Cylinder
Target Box A2 --> (Oops List B has run out of items. Now GH will repeat the last item = Cylinder)
Target Box A3 --> Cylinder
.....
Target Box J9 --> Cylinder
Solution
There are two approaches to rectify this the most logical would be to group the geometries into one object (What you had in mind with the bounding box) to do this use the Group Component on the Transform Tab > Utility Panel.
The other approach is far more common in GH mentality. Use the Graft, right click the G input of Morph and select Graft from the Context Menu. This places all of the items in the List on to separate branches. Creating a list of lists (although these new list only have one item). When GH now tries to data match them it will apply the whole of the first geometry list (Only the Cuboid) to all of the target boxes and all of the second list (Cylinder) to the target boxes again.
I hope this helps…
(twice the amount of lines, it'll take twice as long).
If you nest two loops you're iterating over each line, and then you iterate again over each line. So when you now have twice as many lines, it takes four times as long O(N*N) or O(N²)
With an octree you can reduce the second iteration from O(N) to O(log N). The reason octrees are fast is because they allow you to quickly reject large amounts of lines in your set. Lines are no longer stored in a list, but rather in recursive spatial buckets. If we determine that a certain bucket is too far away to possibly yield any valid results, we can instantly skip all the lines in that buckets and any sub-buckets. If you're lucky, you can reject ~85% of the local data in every iteration, which means even large collections of lines are reduced to only a few potential candidates very quickly.
Thinking about this I'm actually not sure now whether lookup in my Tree3d class is O(log N) or O(sqrt N), but the basic principle holds. The reason the resulting algorithm is O(N * log N) is because the outer loop is still O(N) but the inner loop is now replaced with an O(log N) searcher, so you end up with O(N) * O(log N) = O(N log N)
At least that's how I think it works, computational theory has never been my strong suit.
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
Added by David Rutten at 4:55pm on November 29, 2012
al structure that might resemble the shell structure of radiolaria - www.radiolaria.org - and then I want to manufacture it via 3D printing. Do you think mesh will be up to it?
Also, whether the mesh will work or not, could you please explain me the process on how you arrived to the mesh i.e. why you used all these components that you have used in your definition? As I do not want to directly copy and paste it, I want to understand on why you used all the other components to arrive to the resulting mesh. This will be a huge favour.
Knowing that the form that i have created is very important, do you think starting with the curves was the right thing or do you have any other way in mind to achieve this form with XYZ parameters?
regards,
aB…
rsuche deine Befehle später auf mein Modell anzuwenden.
Ja du hast Recht, ich sollte meine Fragen das nächste mal isoliert hochladen. Sorry für die "wirre" Datei.
Dennoch muss ich echt sagen, dass ich es mega schade finde, dass es einige in diesem Forum gibt die einen echt "runtermachen" indem sie ständig auf Fehler hinweisen und einen für komplett bescheuert halten. Es fällt eben nicht jedem leicht ein Programm ohne zusätzliche Hilfe sondern nur durch Ausprobieren zu erlernen. (Musste ich mal kurz loswerden!) Gut, dass es auch solche wie dich gibt, die einen Mut machen.
Gruß und nochmals Danke!…