Horizon touch point

[Arvin-huang1]

input polygon ABCDEBFG
make union operation
the result also ABCDEBFG, how to get two detached polygons ABFG and BCDE

void test() { Paths64 subj = { MakePath({2, 0, 2, 2, 0, 2, 0, 4, 2, 4, 2, 2, 4, 2, 4, 0 }) }; Paths64 sol = Union(subj, {}, FillRule::NonZero); std::cout << sol << std::endl;// 4, 0, 4, 2, 2, 2, 2, 4, 0, 4, 0, 2, 2, 2, 2, 0 }

[AngusJohnson]

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. If this is problematic, then a follow up union operation will bring these solutions very close to their simplest forms.

See http://www.angusj.com/clipper2/Docs/Overview.htm

[Arvin-huang1]

Yes,it's difficult to get their simplest forms.Do you plan to optimizing touch solutions to get their simplest forms in the future, or temporarily not optimizing it for efficiency reasons. Thank you, Angus Johnson.

[AngusJohnson]

Do you plan to optimizing touch solutions to get their simplest forms in the future.

No. Sorry.