data tree and venation

I am trying to connect points from a venation pattern but I can't manage to find a simple way of doing it, the data created by a closest point seems to do what I want, but it means introducing about 50 closest point and line elements, so I need something that doses the same thing but in a simpler way.

I'll appreciate any ideas on how to do it.

Thanks

Attachments:

venation09.gh, 53 KB

Replies to This Discussion

Permalink Reply by Hannes Löschke on December 26, 2012 at 11:21am

We had a similar problem in our project for the 3rd parametric design workshop. Because of the short time, I resorted to scripting my own component, that finds the closest point for each point in the next branch.

Pretty dirty, but one possible solution for you.

If you knew the relation of points from the original algorithm, this would be way easier.

Permalink Reply by Hannes Löschke on December 26, 2012 at 11:21am

...forgot the file :D

Attachments:

connect_CP_through_branches.gh, 54 KB

Permalink Reply by Mario A. Benavides on December 26, 2012 at 11:49am

It works great!!

As far as "the relation of points from the original algorithm", I am really beginning with data trees and the way I got the venation points is really messy and some parts are still very "manual", I tried to determine the correct venations to join, but ended up deciding that it was faster to do with "closest point".

Thank you!

Permalink Reply by Hannes Löschke on December 26, 2012 at 12:04pm

You are probably right about CP being the fastest way. Since your "growing" order is coded in brach indices, it's just a matter of searching the corresponding branches. Since the number of points does'nt match trough the different branches, I coldn't find a way to solve this in GH list logic.

I'd be very interrested if someone has a solution for this.

RSS