Abstract
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.
Cite
CITATION STYLE
APA
Platzman, L. K., & Bartholdi, J. J. (1989). Spacefilling Curves and the Planar Travelling Salesman Problem. Journal of the ACM (JACM), 36(4), 719–737. https://doi.org/10.1145/76359.76361
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free