+11I have set of polygons which is county boundaries. And i need to dissolve three nearest neighbors / adjacent polygons into one. and this has to continue till loop ends. But there is no any relationship attribute to group three polygons. in the attached , I manually selected three adjacent boundaries for the methodology how it should work
How can we achieve this using fme?
Best answer by mark2atsafe
Try the SpatialSorter transformer from the FME Hub. Set the Group Size parameter to 3. Then use a Dissolver set to group-by on GroupID.
I can't guarantee it will pick adjacent polygons, but it's a good thing to try and you can experiment with the Grid Size parameter to try and improve the results.
Hope this helps
Mark
+22The number of possibilities are infinite!
And probably you won't be able to arrive flush. Your last dissolved polygon will come from 1 or 2 features.
I'm sure there must be a way to do it though.
+56Try the SpatialSorter transformer from the FME Hub. Set the Group Size parameter to 3. Then use a Dissolver set to group-by on GroupID.
I can't guarantee it will pick adjacent polygons, but it's a good thing to try and you can experiment with the Grid Size parameter to try and improve the results.
Hope this helps
Mark
+12Hi,
An alternate suggestion, if required
Kindly refer the workbench attached. This has to be executed number of times either enhancing by custom transformer or workspacerunner.
Hope this helps
Pratap
+11Try the SpatialSorter transformer from the FME Hub. Set the Group Size parameter to 3. Then use a Dissolver set to group-by on GroupID.
I can't guarantee it will pick adjacent polygons, but it's a good thing to try and you can experiment with the Grid Size parameter to try and improve the results.
Hope this helps
Mark
yah it working, but the problem is not all the resultant polygons have dissolve count 3, some are 2 and some are 1. not happy with the result.
+11Hi Mark,
Please tell me how can i loop back to neighbor finder to rest of candidates.
see, first feature found two neighbors and comes out with matched port, now the second feature has the same neighbor (one or two) _candidates markings which are already paired with first feature. so this feature dissolve its own or with only one neighbor. this should happen. i want to give the remaining set of candidates for the second base feature. how can i do that.
if i have 1000 county bndys, first goes in and found two. now when second comes in and search with 997 neighbors. and the third should search with 994 neighbors like that... it has to go to until loop ends.
is there any way to achieve this?
