. The rules to dispatch the lines are the next:
I start with a list that alternate true/false; like that: true, false, true, false.
If the angles between those lines are greater than 89° I want to inverse the next part of the list:
True, False, True, False, True, False,...
become
True, False, [>89°] False, True, False, True, [>89°] True, False,...
I managed to create a true false list, to check for the greater than 89° angle, to separate the lines relatively to the angles, but I don't know how to inverse part of the list at certain index.
(In the picture, I have written 90° but it should be 89°, I check for greater than 89° and not equal to 90° because in the real rhino model, the lines won't be exactly orthogonal)
If you have another idea to to reach the same result, it's also okay, I tried to find rules to solve the problems, but I may have overlooked other solutions !
And if there is some part of the patch that are correct but there is easier solution, I would love to learn as I am still new to grasshopper.
Thanks for taking the time to read. :)
…
he code within a limited number of turns. I suggest you check 양방하는법 and learn more interesting things about games. The game is not only challenging and fun, but it also helps to improve cognitive skills such as critical thinking, problem-solving, and pattern recognition. Mastermind has stood the test of time and remains a beloved game for all ages.…
Added by MichaelD0112 at 12:25am on April 10, 2023
rence not set to an instance of an object. (line: 80)
Both .dlls appear to have been successfully imported.
Thanks in advance,
Charles
RStatSystem rs = ri as RStatSystem;
List<Line> slines = new List<Line>();
foreach(RStatBeam b0 in rs.Beams) { <------ line 80
if (b0.StiffnessMultiplier < 0.3) continue;
slines.Add(new Line(b0.P0.ToPoint3d(), b0.P1.ToPoint3d())); }
A = slines;
…
nt B2[i] so B1[i]<=0 means no new connections allowed for point i ,so point i is deleted from B1, B2 updated accordingly.
Initialization:
B1: max number of connections x number of points
B2: all the points
B3: nothing (well null or something, need to create the branch)
Algo:
Get first point in B2, get his allowed number of connections N in B1, find N closest points in B2, create lines in B3, update B2 accordingly. Erase points with max connections (including the first point)
Next
Stop when no points available
At end of loop, B3 stores the created lines.
…