SpatialFilter using one file (Trying to dissolve polygons without donuts etc.)

Have a look at the custom transfomer the listcombiner. After you get a list determining relationships from a spatial relator you can assign a common id to shapes that are within or contained by each other. You can then dissolve by this group

A quick example

dissolve_shapes.fmwt

Which takes you from 7 shapes down to 4

This is a good idea, but unfortunately fails as much of the geometry that is entirely within also touches the outer boundary. It was able to simplify 10 of the 192 objects.

I think the problem is what you think entirely within is not in fact entirely within. It shouldn't matter if there is a point where shapes touch or have a coincident boundary. The smaller square would be dissolved into the larger square in this scenario

Unfortunately, if there are very tiny overlaps it makes your process more problematic, as you then have to evaluate if 99.9% of the area of the polygon is within another.

You could try applying a negative buffer to your suppliers before a spatial relator

That very well could be as it is possible that some of the objects do in fact slightly slip outside of the larger polygon. I will give your solution a go after running another possible solution. Thanks!

to look for within and not touching, you need to query the cardinality or the d9im matrix.

First one is easiest.

Set calculate cardinality = yes.

Concatenate the _relationships list{}.card_line and card_area with no separator.

Then test card_area concatenation >0 && car_line = 0

@bkingston

The predicates EQUAL,WITHIN AND CONTAIN are always met, as the requestor = supplier.

This is an issue for your query.

The help file pertaining this transformer sates:

Contains:

The interiors intersect and no part of the candidate's interior or boundary intersects the base's exterior. It is possible for the boundaries to intersect.

and

Within:

The interiors intersect and no part of the base's interior or boundary intersects the candidate's exterior. It is possible for the boundaries to intersect.

If you set calculate cardinality = yes and list concatenate relationships{}pass.

and select all predicates except EQUALS,CONTAINS, WITHIN, and INTERSECT.

And then use a stringsearcher to lok for TOUCHES, you will see none have this relationships.

None of them touch in your sample data.

You can also test this by using a LineOnAreaOverlayer.

Use a counter to ID the objects. Coerce to line a stream for the line input and have it make a list.

Remove duplicate ID' from the list (ListDuplicateRemover). Count the resulting element (Listelementcounter) And then test for elementcount>2.

You get al the touching line pieces, where it is not only their own boundary.

IT seems you have no adequate criterion to do what you want on the sample data. Maybe step back and start form the original data? The posted data is/seems already dissolved or buffered with a buffer size that is too large for this.