I read the tech blog. It's basically a TSP solver optimizing for the longest path. Generate points based on alpha channel, generate a maximally connected planar graph derived from nodes in step 1, use DFS to draw an arbitrary path, then invert triangular inequality to make the path gradually longer. There are some special case considerations like disjoint graphs.