Decomposing Polygons Into Diameter Bounded Components

A decomposition of a polygon P is a set of polygons whose geometric union is exactly P. We consider the problem of decomposing a polygon, which may contain holes, using subpolygons that have a bounded diameter. We show that this problem is NP-complete via a reduction from Planar 3, 4SAT.

• Type: Conference
• Year: 2003
• Where: CCCG
• Authors: Chris Worman
• Keywords: CCCG 2003, CCCG 2007, Decomposition, Geometric Union, Polygons