Cutting out polygon collections with a saw

(IV) Given a collection P of disjoint polygons drawn on a planar piece of material Q, we present a polynomial-time algorithm that computes a suitable cutting sequence to cut the polygons in P out of Q using ray cuts when P is ray-cuttable and otherwise reports P as uncuttable.