Hello,

I’d like to make a graphic for a research project:

I want to show all possible combinations of two lines which are rotated around a point in a certain angle - for example 45° degrees.

In theory I get a list of tuples made out of two angles Alpha and Beta, where Alpha stays at a certain angle while Beta goes ‘around the clock’. Then Alpha goes one step further and so on.

It should look something like this:

(45°,45°);(45°,90°);(45°,135°);(45°,180°);(45°,225°);(45°;270°);(45°,315°);(45°360°);

(90°,90°);(90°,135°);(90°,180°);(90°,225°);(90°;270°);(90°,315°);(90°360°);

(135°,135°),(135°,180°) etc…

I made up a GH-Definition where I figured out the first line (Thanks to HS_Kim from this forum) , but I fail to move the series up in the Y-Direction while resetting the Step to itself +1.

I think the solution has something to do with crossreferencing and manipulating Lists or Trees, but I just don’t get it.

Maybe someone here can give me a quick hint? That would be a relief!

The Image showes the result of the definition in blue and the result that i long for in black.

180627_anglearray_simple.gh (10.6 KB)