The shortest path through many points

TLDR: In this paper, it was shown that the length of the shortest closed path through n points in a bounded plane region of area v is almost always asymptotically proportional to √(nv) for large n; and this result was extended to bounded Lebesgue sets in k-dimensional Euclidean space.

Abstract: We prove that the length of the shortest closed path through n points in a bounded plane region of area v is ‘almost always’ asymptotically proportional to √(nv) for large n; and we extend this result to bounded Lebesgue sets in k–dimensional Euclidean space. The constants of proportionality depend only upon the dimensionality of the space, and are independent of the shape of the region. We give numerical bounds for these constants for various values of k; and we estimate the constant in the particular case k = 2. The results are relevant to the travelling-salesman problem, Steiner's street network problem, and the Loberman—Weinberger wiring problem. They have possible generalizations in the direction of Plateau's problem and Douglas' problem.