Answers are grounded in this paper and cite their sources.
To construct a short tour through points in the plane, the points are sequenced as they appear along a spacefilling curve. This heuristic consists essentially of sorting, so it is easily coded and requires only O ( N ) memory and O ( N log N ) operations. Its performance is competitive with that of other fast methods.
No takes yet. Share an insight, caveat, or question.
Platzman et al. (1989) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: