A fast heuristic based on spacefilling curves for minimum-weight matching in the plane

We present a heuristic to find a good matching on n points in the plane. It is essentially sorting and so runs in O(n log n) worst-case time and linear expected time. Its performance is competitive with that of previously suggested methods. However, it has the advantages of being trivial to code and of being indifferent to the choice of metric or the probability distribution from which the points are drawn.