Hey, I have a polygon A in the center of a couple of other polygons. I want to test each segment of polygon A if it is completly adjacent to at least one of a list of other (closed) polygons. I´ve tried to test the adjacency by using the start and endpoint of each segment and calculate the distance to each other polygon. Unfortunately I cant get the tree structure to work. The goal would be to generate a list for each segment saying if it is adjacent to at least one of the surrounding polygons.
So lets say the inner polygon has 25 segments. The list would then contain 25 true/false values. Thanks in advance!
I like this one better. It explodes the perimeter curves (you were on the right track) and uses Kangaroo’s dupLn(Remove Duplicate Lines) so surfaces with only common vertices are ignored.
I see, this one selects only the adjacent polygons that share a complete segment with the inner polygon. In fact I need it the other way round: Check for each segment of the inner polygon if it lays completly on one of the surrounding polygons. Your previous definition were perfect Thanks!
I lose interest when you call me “sir”.
Test data is useful for anyone looking at the problem, not just me.
It looks like my last version (‘b’) works perfectly. What’s the problem? Version ‘a’ works the same way with your test geometry but I showed examples where it fails, which is why I wrote version ‘b’.
Thanks again. I need an answer to a different question! Your Version C gives me a list of polygons that are adjacent to the inner polygon (5 Polygons). Thanks! But I need to test each of the segments of the inner poylgon (25 segments) if they are on one of the surrounding polygons. So the definition needs to generate a list of 25 true OR false values!
But it´s fine. I came up with a very simple solution which is also embarassing for me. I´m so dumb
Thanks!
