algorithmic modeling for Rhino
When you place the mouse cursor over an input a tooltip window appears where you can see the parameter type that the input expects. If the parameter type has [...] written after it, the component will be run once using all the data in the list (e.g. polyline component). If there is no [...] it will run once for every item in the list (e.g. line from two points component).
As you can see, none of the inputs have [...], so as you'd expect with the default "longest list" data matching behaviour, the component will run 4 times creating 4 curves with one fillet each.
Aaah yeah, at first I thought you could use it on multiple parameters too, but reading the description it says "Fillet a curve at a parameter".
Good tip about the [...] in tooltip window, I never realized what it was meaning.
Thanks Vicente, I get it:)
I think you understand what I was trying, so my next question is: is that way it was intended to behave? I get the longest list rule, but it seems more usefull to me if we could use this fillet component to set the fillet radius at each corner along the curve. Is my logic off about this?
Do you happen to know of a quick workaround to achieve this behaviour?
Still I like it Systemiq, the idea. Let's finds out the fastest and cleanest way we can. Tomorrow:) I'm calling it a day now. Thanks again, love the spirit!
What if the input curve contains curved segments.
Indeed, thinking about it.
But your solution is probably better.
Thought I'd best reply to my own question with this:
I like your efforts guys, but I should have said I was trying to give a nice clean anwer to Simon Vorhammer's question: http://www.grasshopper3d.com/forum/topics/branching-problem
This is when I stumbled upon the question I posted.
Welcome to
Grasshopper
Added by Parametric House 0 Comments 0 Likes
Added by Parametric House 0 Comments 0 Likes
Added by Parametric House 0 Comments 0 Likes
Added by Parametric House 0 Comments 0 Likes
Added by Parametric House 0 Comments 0 Likes
© 2024 Created by Scott Davidson. Powered by