Data matching problem (edge comparison)

I have list of poligon edges (represented by their middle points) This the yellow list on the figure on the left side. I have also a list edges also represented by their middle points. This is the green list on the right sied.

I need to create a third list, in which list the point are present in the right list are removed from the left list.

I indicated the identical ponts wirth an red arrow line.

Actually on the right list has always identical pair or pairs in the left list. But the number of leves in the identical branch is different. In some cases it has also there leaves. Sometimes it has two, and somtimes it has just one leaf. AS you can see sometimes the order of the points in the right side are also not identical on the left side. I guess I have to compare distances and use dispatch, but i dont know how... Or cross reference is the solution? Please help!

Attachments:

data matching.jpg, 131 KB

Replies to This Discussion

Permalink Reply by Furion Huang on November 4, 2013 at 12:25am

Just a quick thought, you can merge these two dataTrees, and use [cull duplicates] and choose the option to be [cull all].

Didn't try myself, if you can attach your definition I can test it for you.

Permalink Reply by Danny Boyes on November 4, 2013 at 3:15am

I cannot access Grasshopper at the moment to demonstrate this so if someone else whats to add the relevant images please do.

In the Sets Tab you will find a Set Panel which has mostly green icons in. These are the Grasshopper Set Components. Amongst these there will be one that will show all occurrences of List A that do not appear in List B

Permalink Reply by David Stasiuk on November 4, 2013 at 3:39am