Andrei Raducanu Male Bucharest Romania: Share; Share on Twitter; Share on Facebook

Andrei Raducanu's Apps

Andrei Raducanu's Friends

View All

Andrei Raducanu's Discussions

Sorting points/curves according to their location into tree branches

it's the weirdest thing! the equality compare component doesn't give the right answer unless i pass the data through a panel first. maybe it's a bug or something... anyway, this should work (attachme…

Tagged: structure, tree, sort, analysis, curve

Replied Apr 27

divide segment in random sub-segments with min and max lenghts

got it! i wat thinking that i put the segment lenghts through the graph mapper, not the time of each split point. thanks! EDIT: Although, i don't really know how i could input the min and max value…

Replied Apr 25

divide segment in random sub-segments with min and max lenghts

interesting, but if i put the values through graph mapper, unless the graph is a diagonal, the sum of the output values won't be the same as the sum of the input values

Replied Apr 25

can i modify one end of a curve but get as result a curve with the same length ?

haha, thanks, i downloaded the kangaroo kit a while ago but didn't play with it yet

Replied Apr 25

View All

Andrei Raducanu's Page

Latest Activity

enrique soriano replied to Andrei Raducanu's discussion 'looking for WEIGHTED voronoi'

very nice aproximation!

May 13

Andrei Raducanu replied to Victor Leung's discussion 'Sorting points/curves according to their location into tree branches'

April 27

David Rutten replied to Andrei Raducanu's discussion 'divide segment in random sub-segments with min and max lenghts'

There is; SubCurve Isn't there? -- David Rutten david@mcneel.com Poprad, Slovakia

April 27

Benjamin Golder replied to Andrei Raducanu's discussion 'divide segment in random sub-segments with min and max lenghts'

While I understand the distinction between the length along the curve and the curve parameter, I've found t values extremely easy to work with. It took a while to sink in, but now I find it very intuitive to treat surfaces and curves as 2 and 1 dime…

April 26

Frane Zilic replied to Andrei Raducanu's discussion 'divide segment in random sub-segments with min and max lenghts'

It was so easy to think that t=0.5 was the middle of the curve and u0.5 v0.5 was the middle of the surface!! I miss it already. Thanks

April 26

David Rutten replied to Andrei Raducanu's discussion 'divide segment in random sub-segments with min and max lenghts'

That exactly correct. u and v are simply the two-dimensional variants of t. In fact, u and v are only called u and v by users, programmers tend to prefer s and t. It is actually quite expensive (CPU cycle wise) to calculate an exact length along a…

April 26

Frane Zilic replied to Andrei Raducanu's discussion 'divide segment in random sub-segments with min and max lenghts'

Hi David I always thought that the t value was a parametric evaluation of the length of the curve. Then 0 would be the start, 1 the end, and .5 the half of the length along the curve... I looked around and now I understand that "t" is a variable t…

April 25

David Rutten replied to Andrei Raducanu's discussion 'divide segment in random sub-segments with min and max lenghts'

Ah yes... that should of course be 2pi there in the corner. But in my defense; it's half past one in the morning. -- David Rutten david@mcneel.com Poprad, Slovakia

April 25

David Rutten replied to Andrei Raducanu's discussion 'divide segment in random sub-segments with min and max lenghts'

Hi Frane, no, it shouldn't. Or at least, there's no guarantee it will. Special curve types like Lines, Polyline and arcs might give you constant parameter speed, but NurbsCurves will be more 'dense' in some areas than others. When a curve is more d…

April 25

Frane Zilic replied to Andrei Raducanu's discussion 'divide segment in random sub-segments with min and max lenghts'

Hi Andrei Maybe this is what you need. I would do it simpler but I took all the expressions out of the components to make it clearer. It takes a curve and divides it in N random length segments. With the sliders that define the domain of the random…

April 25

Andrei Raducanu replied to Andrei Raducanu's discussion 'divide segment in random sub-segments with min and max lenghts'

got it! i wat thinking that i put the segment lenghts through the graph mapper, not the time of each split point. thanks!

April 25

David Rutten replied to Andrei Raducanu's discussion 'divide segment in random sub-segments with min and max lenghts'

I meant: 1) create a line segment whose length matches the total length of the intervals you need. 2) divide this line segment into N sections using a [Evaluate Length] component and a range of numbers from 0 to 1 3) Feed the numbers through a Grap…

April 25

Andrei Raducanu replied to Andrei Raducanu's discussion 'divide segment in random sub-segments with min and max lenghts'

interesting, but if i put the values through graph mapper, unless the graph is a diagonal, the sum of the output values won't be the same as the sum of the input values

April 25

Andrei Raducanu replied to Andrei Raducanu's discussion 'can i modify one end of a curve but get as result a curve with the same length ?'

haha, thanks, i downloaded the kangaroo kit a while ago but didn't play with it yet

April 25

David Rutten replied to Andrei Raducanu's discussion 'divide segment in random sub-segments with min and max lenghts'

Well, they wouldn't be random in this case, they'd be a sequence. You could generate a sequence like this with a GraphMapper for example. You just have to be careful that the shortest and longest segments are within your range. {1, 1.2, 1.45, 1.6,…

April 25

David Rutten replied to Andrei Raducanu's discussion 'can i modify the one end of a curve but get as result a curve with the same length ?'

Well, then you'll have to write a physics solver for strings. You'll have to define how the bending forces work etc. as well. This is quite complicated. Kangaroo has done something like this, that might be the only thing standing in between you and…

April 25