This takes a complicated expression assumed to contain multiple instances of leafA
and leafB and returns the equivalent CSG expression involving at most leafA and leafB once
(except for non-manifold shapes).
Remove polygon pol from the list, replacing it with two polygons, the
first being pol's vertices from 0 to st inclusive, and the second being
pol's vertices from en to its end inclusive.