The main improvement is first removing faces that are not contained by the target polygons, since this is a much faster operation than doing the overlay. This could yield slightly different results, since partially-overlapping faces are discarded. Therefore the heuristic of buffering the input polygon regions before selecting the subset of faces is used.
The main improvement is first removing faces that are not contained by the target polygons, since this is a much faster operation than doing the overlay. This could yield slightly different results, since partially-overlapping faces are discarded. Therefore the heuristic of buffering the input polygon regions before selecting the subset of faces is used.