I saw this interesting video of the Youtube channel 3Blue1Brown about the IMO 2011 n°2 problem and i decided to simulate it in gh but i having a hard time understanding how it can be solved.
I manage to do it with two points but it is easy to list and cheat. Once i add more points the algorithm becomes more complicated.
I thought this simulation could be solved easily with one slider. I’m sure i’m kind of close to the answer being somewhat between a loop and booleans distance checking. I tried with anemone but totally misunderstood how it works. I can’t wrap my mind about it.
With “To Polar” component, you can get polar coordinates of your point, and so sort them and pick the first.
With anemone i made iteratively some lists:
– current pivot point index
– vector for current pivot point direction
– rotation angle from previous direction
The definition talk for itself better than many words…
