"The Travelling Salesman"

In this video "The Travelling Salesman" program is drawing a three-dimensional map of the world, visiting in one uninterrupted line 16189 places:
How do you draw a world map on a globe in one continuous line that does not intersect itself? One way to do this is to get a set of places by an organized sampling of the world, and to find the shortest closed loop through them all, which has the nice property of not intersecting itself. LINK: Youtube