Spacefilling Curves and Routing Problems in the Plane,
Loren K. Platzman, John J. Bartholdi · Defense Technical Information Center (DTIC) · 1983
This paper introduces a novel heuristic to compute a minimal-length tour of N given points in the plane: they are sequenced as they appear along a spacefilling curve. The algorithm consists essentially of sorting: it is easily coded, requires only O (N) memory, and may be implemented to execute in O (N log N) operations at most, or O (N) operations on the average.