Animation of the minimum-weight matchings of increasingly many points of two colors in a unit square: https://twitter.com/thienan496/status/1446021847292669953

Because the color densities fluctuate, the matching develops regions of many parallel long edges transporting excess density from one place to another. This is reflected mathematically in the fact that the expected length is \(\Theta(\sqrt{n\log n})\) compared to \(\Theta(\sqrt{n})\) for non-bipartite matching; see https://doi.org/10.1007/BF02579135