Minimum K-Partitioning of Rectilinear Polygons

A minimum k-partition decomposes a rectilinear polygon with n vertices into aminimum number of disjoint rectilinear components with no more than k vertices each (k=8; most results are also new for k=6.

[1]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

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

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

[4]  Kurt Mehlhorn,et al.  Fast Triangulation of Simple Polygons , 1983, FCT.

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

[6]  Sartaj Sahni,et al.  Fast algorithm for polygon decomposition , 1988 .

[7]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[8]  G. Klincsek.  Minimal Triangulations of Polygonal Domains , 1980 .

[9]  Jack Sklansky,et al.  Minimal rectangular partitions of digitized blobs , 1984, Comput. Vis. Graph. Image Process..

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

[11]  Oliver Günther,et al.  The cell tree: An index for geometric databases , 1988 .

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

[13]  Daniel J. Kleitman,et al.  An algorithm for constructing regions with rectangles: Independence and minimum generating sets for collections of intervals , 1984, STOC '84.

[14]  R. Bellman.  Dynamic programming. , 1957, Science.

[15]  Joseph O'Rourke,et al.  Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.

[16]  B. Chazelle,et al.  Optimal Convex Decompositions , 1985 .

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

[18]  Jörg-Rüdiger Sack,et al.  Algorithms for minimum length partitions of polygons , 1987, BIT Comput. Sci. Sect..

[19]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[20]  Takao Asano,et al.  Efficient Algorithms for Geometric Graph Search Problems , 1986, SIAM J. Comput..

[21]  D. T. Lee,et al.  Location of a point in a planar subdivision and its applications , 1976, STOC '76.

[22]  J. Mark Keil.  Minimally covering a horizontally convex orthogonal polygon , 1986, SCG '86.

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

[24]  Bernard Chazelle,et al.  Triangulation and shape-complexity , 1984, TOGS.

[25]  J. Sack,et al.  Minimum Decompositions of Polygonal Objects , 1985 .

[26]  Takao Asano,et al.  Minimum partition of polygonal regions into trapezoids , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[27]  Oliver Günther,et al.  Efficient Structures for Geometric Data Management , 1988, Lecture Notes in Computer Science.

[28]  Takao Asano,et al.  Partitioning a polygonal region into trapezoids , 1986, JACM.

[29]  Kevin D. Gourley,et al.  A Polygon-to-Rectangle Conversion Algorithm , 1983, IEEE Computer Graphics and Applications.

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

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

[32]  Teofilo F. Gonzalez,et al.  Bounds for partitioning rectilinear polygons , 1985, SCG '85.

[33]  Rodney A. Brooks,et al.  Solving the Find-Path Problem by Good Representation of Free Space , 1983, Autonomous Robot Vehicles.