Correct substitution for StrictlySimple from Clipper1

[olologin]

Hi,
I think previously we used this code to make strictly simple polygons out of weakly simple:
http://www.angusj.com/delphi/clipper/documentation/Docs/Units/ClipperLib/Classes/Clipper/Properties/StrictlySimple.htm

ClipperLib::Clipper clipper;
ClipperLib::Paths tmpPaths;
ClipperLib::PolyTree tree;

// Fill tmpPaths here

for (size_t pathIdx = 0; pathIdx < tmpPaths.size(); ++pathIdx)
if (!polylines[pathIdx].IsEmpty())
	clipper.AddPath(
		tmpPaths[pathIdx], ClipperLib::ptSubject, true);

clipper.StrictlySimple(true);
clipper.Execute(ClipperLib::ctUnion, tree, fillRule);

Clipper2 docu says:
A lot of effort has gone into returning solutions close to their simplest forms, but there's no way to do this perfectly without significantly degrading performance. So there will, on occasions, be solutions with polygons that are [touching](http://www.angusj.com/clipper2/Docs/Overview.htm#touching). If this is problematic, then a follow up union operation will bring these solutions very close to their simplest forms.

As I understand simple Union operation is enough to achieve similar effect? No other magic and flag flipping is needed?
Sorry for maybe simple question, Asking just to be sure I am porting product correctly.

[AngusJohnson]

In Clipper1, the SimplifyPolygons function performed a Union operation and also calls DoSimplePolygons. This latter function checked polygons for non-adjacent matching vertices. These are likely to be places where polygons can be separated into two polygons (see here). Due to changes in Clipper2, I believe the need for this has been substantionally reduced, though I doubt is has been entirely eliminated. So far, I haven't seen the need to reimplement this functionality.

[olologin]

Ok, so simple Union at the moment is the closest thing we can do.
Thanks for your answer.