re need polygon splitting algo in article qvq b r t wampyr cc uow edu au g wampyr cc uow edu au coronado emmanuel abad writes the idea is to clip one polygon using another polygon not necessarily rectangular as a window my problem then is in finding out all the new vertices of the resulting subpolygons from the first one is this simply a matter of extending the usual algorithm whereby each of the edges of one polygon is checked against another polygon is there a simpler way comments welcome noel it depends on what kind of the polygons convex simple concave trouble concave with loop s inside big trouble of cause you can use the box test to avoid checking each edges according to my experience there is not a simple way to go the headache stuff is to deal with the special cases for example the overlapped lines yeh usc
