title: Compare Two Paths for Similarity
body: <p>I have path set A and path set B. I am trying to find an algorithm to compare both path sets for similarity.</p>
  
  <p><strong>Path characteristics:</strong></p>
  
  <ol>
  <li>Path sets are one or more lines with two or more points per line. Lines do not have to be connected.</li>
  <li>Path sets may overlap themselves (i.e. an X).</li>
  <li>Path sets may contain different number of vertices (i.e. one path may look similar to the other but have a lot more points in it).</li>
  <li>Points are not guaranteed to be in order for both path sets.</li>
  </ol>
  
  <p>Scale should be taken into account, i.e. a small X should match a large X. Translation does not need to be taken into account for any paths because the bottom most point of any path will have y of 0 and left most point of any path will have x of 0.</p>
  
  <p>Is there a best practice or well known algorithm (I have found little in my Google searches) to compare these kinds of path sets for similarity?</p>