Is it possible to get two different areas If the result of a difference operation result in 2 polygons (not connected)

[AhsinChoudhry786]

Is there any way to get two different green areas If the result of a difference operation result in 2 polygons (not connected), is it possible to seperate the list of points into the 2 polygons? (e.g. the green areas)

[AngusJohnson]

  Paths64 sub, clp, sol;
  
  sub.push_back(MakePath({ 40,50, 80,50, 80,100, 40,100 }));
  clp.push_back(MakePath({ 20,20, 60,20, 60,80, 20,80 }));
  clp.push_back(MakePath({ 50,60, 100,60, 100,150, 50,150 }));

  sol = Difference(sub, clp, FillRule::NonZero);
  std::cout << sol << std::endl;

  SvgWriter svg;
  SvgAddSubject(svg, sub, FillRule::NonZero);
  SvgAddSubject(svg, sub, FillRule::NonZero);
  SvgAddClip(svg, clp, FillRule::NonZero);
  SvgAddSolution(svg, sol, FillRule::NonZero, false);
  SvgSaveToFile(svg, "c:\\temp\\tmp.svg", 400,300);
  System("c:\\temp\\tmp.svg");

50,100 , 40,100 , 40,80 , 50,80
80,60 , 60,60 , 60,50 , 80,50