Question

How to iteratively merging rings

C
Badge +1

I have a set of polygons resembling the Towers of Hanoi (I have many towers with varying rings but only included one tower here):

I would like to start with the polygons which doesn't have any holes and which are holes in other polygons (in this case I only have the small one in the center) and dissolve it with the polygon in which it is a hole. I would like to repeat this until the dissolved area is larger than some threshold (here 30).

Can I do this in FME 2016?

I have attached a shape file with the data set above.

1 Attachment

3 replies

takashi
Rank
Userlevel 2
Badge +17
The Dissolver can dissolve those rings at once and form a single large polygon. Why do you need iteration?

 

 

C
Badge +1
The Dissolver can dissolve those rings at once and form a single large polygon. Why do you need iteration?

 

 

I need it because of the combined dissolved area threshold, at least I think I need it.
takashi
Rank
Userlevel 2
Badge +17

Hi @chau, if all the rings are donuts, remove hole from them, calculate area for each, then select one which has the maximum area within the threshold. I think it would be your desired result. This is an implementation example.

Reply


Community Stats

28,714
Posts
109,490
Replies
36,561
Members
Terms & ConditionsCookie settings
A product of
Safe Software respectfully acknowledges that we live, learn and work on the traditional and unceded territories of the Kwantlen, Katzie, and Semiahmoo First Nations.