s 8, 4, 2, 10, 1, 3, 8, 4, 2, 0. But then for the end result to maintain all numbers above 5 but replace all numbers below with a defined number..Let's say zero. So then the list would read...8, 0, 0, 10, 0, 0, 8, 0, 0.…
1+2+3+4+5+6 = 21
1+2+3+4+5+6+7 = 28
1+2+3+4+5+6+7+8 = 36
1+2+3+4+5+6+7+8+9 = 45
Is there a tool, that can do me that job?
How do I get this List {1,3,6,10,15,21,28,36,45}?…
Added by Ahmed Hossam at 2:19pm on September 22, 2013
onnected to 10 points --> 3 of 10 Lines have an intersection with the brep
point "1" is connected to 10 points --> 5 of 10 Lines have an intersection with the brep
point "2" is connected to 10 points --> 2 of 10 Lines have an intersection with the brep
I actually got this information but as you can see the algorithm become pretty long…
Added by Robert Megel at 12:46pm on November 1, 2012
is passable give different distance in list of point to delete
ex: point 1 - 30
point 2 - 20
point 3 - 10
...........
the point all in one list
i try a lot but didn't found the way ...
radius / 3 Then field_value += 1 * (1 - 3 * test_dist ^ 2 / radius ^ 10) ElseIf test_dist >= radius / 3 And test_dist < radius Then field_value += (3 / 2) * (1 - test_dist / radius) ^ 10
Not sure yet how to reduce the new angled beam artifacts.
The question remains whether there is a superior function that avoids bulge completely so I can start rationally designing bulk objects with mere lines.
Actually, if I move a parentheses to make both powers into divisors and tweak the sliders, I get rid of nearly all bulge, while improving the corners:
If test_dist > 0 And test_dist < radius / 3 Then field_value += 1 * (1 - 3 * test_dist ^ 2 / radius ^ 10) ElseIf test_dist >= radius / 3 And test_dist < radius Then field_value += (3 / 2) * (1 - test_dist / radius ^ 10)
That I can work with!
…
- C
{2;0} (N=61) - D
{2;1} (N=60) - E
{2;2} (N=61) - F
group 2:
{0;0} (N=10) - U
{0;1} (N=10) - V
{0;2} (N=10) - W
{0;3} (N=10) - X
{0;4} (N=10) - Y
{0;5} (N=10) - Z
the idea case is I can merge those date sets in a pattern of A-U-B-V-C-W-D-X-E-Y-F-Z...so on
therefore I am thinking how could I modify the path on group 2 and make them becomes things like:
{0;0} (N=10) - U
{0;1} (N=10) - V
{0;2} (N=10) - W
{1;0} (N=10) - X
{1;1} (N=10) - Y
{1;2} (N=10) - Z
but I have no idea how could I modify the path in that way....
can anyone show me how to?…
Added by Preston Chan at 8:34pm on October 26, 2010