Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4949562 | Discrete Applied Mathematics | 2017 | 11 Pages |
Abstract
(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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Adrian Dumitrescu, Anirban Ghosh, Masud Hasan,