Around The World In 10 Minutes: Best Tour Of 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.

Here we find the shortest tour through 16189 primary degree confluences, drawn without lifting pen from globe, without self-intersections.

More details in the video.

Further information:
Degree Confluence Project (www.confluence.org)

Category:

Howto & Style

Tags:

• TSP
• DCP
• degree
• confluence
• project
• traveling
• salesman
• problem
• computer
• software
• mencoder
• matlab
• neos
• concorde
• geography

[Cid147]

awesome what program is this?

[brhaspati]

Matlab for the rendering. The end credits have detailed info.

[madddoxxxx]

i've my backpack ready, how many miles is it alltogether?

[figifool69696923]

this is not what i bargained for lol

[denelson83]

Now the challenge: Actually pull this journey off. It actually will not be possible, because of North Korea.

[lifeisadancer]

this is great

[330s13th]

Amazing! Nice work.