Happy Rainbow IntCrv

Hi All,

since nobody has been drinking coffee lately, I am posting what I am playing with, because I guess there are several ways to do it. So my least component solution (10 + 2 to colour) was a geometry-based workaround.

Can you do better?

Task:

 Given is a set of points with different stages. The goal is a set of interpolated curves (here 13 per branch) through these points, if the points are within a certain distance to each other.

- If some of the points are inside the minimum distance you will have several curves (here two per branch) - Stage 00

-If all are in range, you will have one closed curve per branch

-If nothing is in range, there are no curves.

Rules:

-Do not use Gate or If  

-Following the first rule and still making Stage 00 periodic will give copious amounts of extra points.