title: TSP - Traveling around a center
body: <p>For an optimization course we are encouraged to think of an algorithm for solving the Travelling Salesman Problem. I have an idea for a solution, and I think it's pretty rad. The steps for the algorithm are listed below. The order of the steps correspond to the order of the images.</p>
  
  <ol>
  <li>Find the center of the points (red dot)</li>
  <li>Travel around the center</li>
  <li>Remove the largest line</li>
  </ol>
  
  <p>The main sub-problem here is step 2. How does one go about traveling around a center point? Is there a good algorithm to do this?</p>
  
  <p>I have another question about the algorithm's performance. How bad is this algorithm? Can you show me an example where it would give a worst-case answer?</p>
  
  <p><img src="https://i.stack.imgur.com/Vnovg.png"></p>
  
  <p><img src="https://i.stack.imgur.com/2MVn0.png"></p>
  
  <p><img src="https://i.stack.imgur.com/Sstdp.png"></p>