Decomposing polygonal regions into convex quadrilaterals

A potygonat region is a closed region of the plane formed by cutting holes bounded by polygons out of a region bounded by a polygon. Vertices [e@es] of a polygonal region are vertices [edges] of the bounding polygon and the hole polygons. A chord of a polygonal region is a line segment inside the region joining two vertices. Decomposing a polygonal region into quadrilaterals means adding chords, no two of which cross, so that the minimal regions formed by the chords and edges are quadrilaterals. This work is about decomposing polygonal regions into convex quadrilaterals.

[1]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[2]  Michael Ian Shamos,et al.  Geometric intersection problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

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

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Robert E. Tarjan,et al.  Triangulating a Simple Polygon , 1978, Inf. Process. Lett..

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

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

[8]  J. O'Rourke.  An alternate proof of the rectilinear art gallery theorem , 1983 .

[9]  J. Kahn,et al.  Traditional Galleries Require Fewer Watchmen , 1983 .

[10]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[11]  J. O'Rourke,et al.  Stationing guards in rectilinear art galleries , 1984 .

[12]  J. Mark Keil,et al.  Decomposing a Polygon into Simpler Components , 1985, SIAM J. Comput..