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.

Attachments:

120814 Coffee Rainbow.gh, 26 KB

Replies to This Discussion

Permalink Reply by Kim Dong Wook on August 14, 2012 at 6:24am

I try to this method. but I don't know the mean 'minimal distance'.....

Attachments:

120814CoffeeRainbow_dw.gh, 29 KB

Permalink Reply by phillip on August 14, 2012 at 11:40am

I think the description was to complicated, because I wanted it in Trees but Lists. Now, lets make it easy.

Given is a set of points. The order is fixed but the start could shift. Connect the ones within a certain distance to each other with one Crv.

Permalink Reply by Scott Ward on July 6, 2022 at 5:30am

Cool jib! I found it really interesting and up-to-date. Do you know anything about Flutter and React Native - the two leading frameworks? I wrote an amazing article about that topic a few month ago. you can read it here.

RSS