What about polylabel(..) function for multipolygon?

[kostov]

like this

[mourner]

Just run it on each of the polygons separately, and then pick the one with the biggest distance or the one closer to the multipolygon centroid.

[kostov]

If there is no interior building (we just have a bagel -- just 2 polygons), wouldn't it turn out that the result is in a hole?

[mourner]

If there's no interior building, you would run polylabel on a polygon with hole and get the point somewhere on the polygon. Not sure I get your question.

[kostov]

Is polygon with hole possible? I think polygon with hole == 2 polygons: first is outer, second is inner.

[kostov]

Sorry: get it.
struct polygon : Cont<linear_ring>
I thought polygon is a container of points.