Non-intersecting connections of random points

Zach Star posted [this](https://youtu.be/AWspiqNvQfM) video recently and it seemed to fit the format of a good coding challege. Given N random points of color A and N random points of color B, find the N connections between each A point and a distinct B point (one-to-one and onto) such that no 2 connections cross paths. For animation effect: select random connections between A points and B points and animate the algorithm to establish non-intersecting connections.