Find the shortest path for scanner
<p>I am working on a nearfieldscanner and need to find a way to get the shortest path for the scannerhead.</p>

<p>Suppose I want to use 13 points at once. </p>

<ul>
<li>Then I take the current position (point0) from the scanner and look for the nearest point (Point1).</li>
<li>Now Point1 becomes the current position and I look for the nearest point to point1 -(point2).</li>
<li>Now point2 becomes the current point and so on...</li>
</ul>

<p>Offcourse this isn't really the shortest path.</p>

<p>The scanner has to be able to handle 25points or more at once so permutations are not an option.
It takes 0.45s to travel 1cm and the surface is mostly 10x15cm.</p>

<p>The main goal is to win time and make the scan faster. </p>

<p>This has to be done in C# or Matlab.</p>

<p>Is this possible? </p>
