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 O1989 memory and O(N log N) operations. Its performance is competitive with that of other fast methods. © 1989, ACM. All rights reserved.
Mendeley helps you to discover research relevant for your work.