Spacefilling curves and the planar travelling salesman problem

Authors:
Loren K. Platzman;John J. Bartholdi, III
Affiliations:
Georgia Institute of Technology, Atlanta;Georgia Institute of Technology, Atlanta
Venue:
Journal of the ACM (JACM)
Year:
1989

Citing 3
Cited 23

Heuristics based on spacefilling curves for combinatorial problems in Euclidean space

Management Science
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem

Operations Research Letters

Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves

IEEE Transactions on Parallel and Distributed Systems
Experiences with Parallel N-Body Simulation

IEEE Transactions on Parallel and Distributed Systems
Incremental constructions con BRIO

Proceedings of the nineteenth annual symposium on Computational geometry
SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion

ACM Transactions on Mathematical Software (TOMS)
Universal approximations for TSP, Steiner tree, and set cover

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Easily-managed and topology-independent location service for self-organizing networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Improved lower and upper bounds for universal TSP in planar metrics

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Structure-based querying of proteins using wavelets

CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Twins: A Dual Addressing Space Representation for Self-Organizing Networks

IEEE Transactions on Parallel and Distributed Systems
Compact Hilbert indices: Space-filling curves for domains with unequal side lengths

Information Processing Letters
Lipschitz and Hölder global optimization using space-filling curves

Applied Numerical Mathematics
An information global minimization algorithm using the local improvement technique

Journal of Global Optimization
Improved lower bounds for the universal and a priori TSP

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Stochastic minimum spanning trees in euclidean spaces

Proceedings of the twenty-seventh annual symposium on Computational geometry
Sampling multidimensional signals by a new class of quasi-random sequences

Multidimensional Systems and Signal Processing
On sampling in higher-dimensional peer-to-peer systems

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Algorithms for the universal and a priori TSP

Operations Research Letters
An O(N log N) planar travelling salesman heuristic based on spacefilling curves

Operations Research Letters
Match twice and stitch: a new TSP tour construction heuristic

Operations Research Letters
Efficacy of spacefilling heuristics in Euclidean combinatorial optimization

Operations Research Letters
Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem

Operations Research Letters
Reordering rows for better compression: Beyond the lexicographic order

ACM Transactions on Database Systems (TODS)
Practical distribution-sensitive point location in triangulations

Computer Aided Geometric Design

Quantified Score

Hi-index	0.00

Visualization

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 O(N) memory and O(N log N) operations. Its performance is competitive with that of other fast methods.