2

define a set of polygon A. the input is a polygon B.

I have to output a set of Polygon R, which is the subset of A, and if I union all polygon in R into a polygon C, C and A should be as similar as possible. Just like figure below:

enter image description here

Nic3500
  • 8,144
  • 10
  • 29
  • 40
  • 2
    Intersect every candidate polygons with the input and keep those with a significant overlap. Preferably use a ready-made polygon intersection library, as this is an uneasy problem. –  Aug 09 '18 at 21:13
  • This depends on what exactly you understand by "similar." Since you want to program this, your computer will need a clear criterion enabling it to say "polygon C is more similar to A than D is." Without that, I'm afraid that your question is too vaguely defined to get a clear answer. – Dominik Mokriš Oct 27 '18 at 11:53

0 Answers0