I have path set A and path set B. I am trying to find an algorithm to compare both path sets for similarity.
Path characteristics:
- Path sets are one or more lines with two or more points per line. Lines do not have to be connected.
- Path sets may overlap themselves (i.e. an X).
- 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).
- Points are not guaranteed to be in order for both path sets.
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.
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?