Some NP-hard polygon decomposition problems

The inherent computational complexity of polygon decomposition problems is of theoretical interest to researchers in the field of computational geometry and of practical interest to those working in syntactic pattern recognition. Three polygon decomposition problems are shown to be NP-hard and thus unlikely to admit efficient algorithms. The problems are to find minimum decompositions of a polygonal region into (perhaps overlapping) convex, star-shaped, or spiral subsets. We permit the polygonal region to contain holes. The proofs are by transformation from Boolean three-satisfiability, a known NP-complete problem. Several open problems are discussed.

[1]  Godfried T. Toussaint,et al.  An Efficient Algorithm for Decomposing a Polygon into Star-Shaped Polygons , 1981 .

[2]  Joseph R'Rourke,et al.  Polygon decomposition and switching function minimization , 1982 .

[3]  Steve Fisk,et al.  A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.

[4]  Theodosios Pavlidis,et al.  Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition , 1975, IEEE Transactions on Computers.

[5]  Narendra Ahuja,et al.  Interference Detection and Collision Avoidance Among Three Dimensional Objects , 1980, AAAI.

[6]  Robert M. Haralick,et al.  Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Theodosios Pavlidis,et al.  STRUCTURAL PATTERN RECOGNITION: PRIMITIVES AND JUXTAPOSITION RELATIONS* , 1972 .

[8]  Bernard Chazelle,et al.  Convex decompositions of polyhedra , 1981, STOC '81.

[9]  B. G. Batchelor,et al.  Hierarchical Shape Description Based upon Convex Hulls of Concavities , 1980, Cybern. Syst..

[10]  Bernard Chazelle,et al.  Decomposing a polygon into its convex parts , 1979, STOC.

[11]  Theodosios Pavlidis,et al.  Analysis of set patterns , 1968, Pattern Recognit..

[12]  Kiyoshi Maruyama.  Study of visual shape perception , 1972 .

[13]  Theodosios Pavlidis,et al.  Representation of figures by labeled graphs , 1972, Pattern Recognit..

[14]  D. Kleitman,et al.  Covering Regions by Rectangles , 1981 .

[15]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[16]  Franco P. Preparata,et al.  Testing a Simple Polygon for Monotonicity , 1981, Inf. Process. Lett..

[17]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

[18]  Andrzej Lingas,et al.  The Power of Non-Rectilinear Holes , 1982, ICALP.

[19]  Bruce J. Schachter,et al.  Decomposition of Polygons into Convex Sets , 1978, IEEE Transactions on Computers.

[20]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[21]  Godfried T. Toussaint,et al.  PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .

[22]  P. Giblin.  Graphs, surfaces, and homology , 1977 .

[23]  Theodosios Pavlidis,et al.  A review of algorithms for shape analysis , 1978 .

[24]  Theodosios Pavlidis,et al.  Structural pattern recognition , 1977 .