Polygon Decomposition

[1]  Christos Levcopoulos,et al.  Improved Bounds for Covering General Polygons with Rectangles , 1987, FSTTCS.

[2]  Reuven Bar-Yehuda,et al.  A linear time algorithm for covering simple polygons with similar rectangles , 1996, Int. J. Comput. Geom. Appl..

[3]  Joseph C. Culberson,et al.  Covering Polygons Is Hard , 1994, J. Algorithms.

[4]  Anna Lubiw,et al.  Decomposing polygonal regions into convex quadrilaterals , 1985, SCG '85.

[5]  Daniel J. Kleitman,et al.  An Algorithm for Covering Polygons with Rectangles , 1986, Inf. Control..

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

[7]  Jorg-Rudiger Wolfgang Sack,et al.  Rectilinear computational geometry , 1984 .

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

[9]  T. C. Shermer,et al.  Recent results in art galleries (geometry) , 1992, Proc. IEEE.

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

[11]  Deborah S. Franzblau.  Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles , 1989, SIAM J. Discret. Math..

[12]  T. Shermer.  Recent Results in Art Galleries , 1992 .

[13]  Sartaj Sahni,et al.  Fast algorithm for polygon decomposition , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Christos Levcopoulos.  A fast heuristic for covering polygons by rectangles , 1985, FCT.

[15]  Witold Lipski,et al.  An O(n log n) Manhattan Path Algorithm , 1984, Inf. Process. Lett..

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

[17]  Chandrajit L. Bajaj,et al.  Convex Decomposition of Polyhedra and Robustness , 1992, SIAM J. Comput..

[18]  Svante Carlsson,et al.  Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons , 1993, Int. J. Comput. Geom. Appl..

[19]  Thomas C. Shermer.  On recognizing unions of two convex polygons and related problems , 1993, Pattern Recognit. Lett..

[20]  Witold Lipski,et al.  Finding a manhattan path and related problems , 1983, Networks.

[21]  Andrzej Lingas,et al.  Covering Polygons with Minimum Number of Rectangles , 1984, STACS.

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

[23]  Alan E. Middleditch,et al.  Convex Decomposition of Simple Polygons , 1984, TOGS.

[24]  Jimmy J. M. Tan,et al.  Minimum partitioning simple rectilinear polygons in O(n log log n) - time , 1989, SCG '89.

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

[26]  Dipen Moitra.  Efficient Parallel Algorithms for Covering Binary Images , 1989 .

[27]  S. Sitharama Iyengar,et al.  A New Method of Image Compression using Irreducible Covers of Maximum Rectangles , 1988, IEEE Trans. Software Eng..

[28]  Teofilo F. Gonzalez,et al.  Inproved Bounds for Rectangular and Guillotine Partitions , 1989, J. Symb. Comput..

[29]  Hans-Dietrich Hecker,et al.  Some NP-hard Polygon Cover Problems , 1989, J. Inf. Process. Cybern..

[30]  Anna Lubiw.  The Boolean Basis Problem and How to Cover Some Polygons by Rectangles , 1990, SIAM J. Discret. Math..

[31]  Valeriu Soltan,et al.  Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles , 1993, Discret. Comput. Geom..

[32]  J. Mark Keil.  Covering Orthogonal Polygons with Non-Piercing Rectangles , 1997, Int. J. Comput. Geom. Appl..

[33]  Anne Kaldewaij,et al.  Rectangular Partition is Polynomial in Two Dimensions but NP-Complete in Three , 1991, Inf. Process. Lett..

[34]  András Hegedüs.  Algorithms for covering polygons by rectangles , 1982 .

[35]  Kurt Mehlhorn,et al.  Fast Triangulation of the Plane with Respect to Simple Polygons , 1985, Inf. Control..

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

[37]  Christos Levcopoulos,et al.  Quasi-greedy triangulations approximating the minimum weight triangulation , 1996, SODA '96.

[38]  Frédéric Maire,et al.  Polyominos and Perfect Graphs , 1994, Inf. Process. Lett..

[39]  Oliver Günther,et al.  Minimum K-Partitioning of Rectilinear Polygons , 1990, J. Symb. Comput..

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

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

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

[43]  Joseph C. Culberson,et al.  Covering a simple orthogonal polygon with a minimum number of orthogonally convex polygons , 1987, SCG '87.

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

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

[46]  Chuan Yi Tang,et al.  Covering convex rectilinear polygons in linear time , 1991, Int. J. Comput. Geom. Appl..

[47]  Laxmi Gewali,et al.  Minimum Covers for Grids and Orthogonal Polygons by Periscope Guards , 1990 .

[48]  Leonidas J. Guibas,et al.  A linear-time algorithm for computing the voronoi diagram of a convex polygon , 1989, Discret. Comput. Geom..

[49]  D. T. Lee,et al.  Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.

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

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

[52]  Godfried T. Toussaint,et al.  Guard Placement in Rectilinear Polygons , 1988 .

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

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

[55]  Andrzej Lingas,et al.  Bounds on the Length of Convex Partitions of Polygons , 1984, FSTTCS.

[56]  J. Shearer.  A Class of Perfect Graphs , 1982 .

[57]  Andrzej Lingas.  Heuristics for minimum edge length rectangular partitions of rectilinear figures , 1983 .

[58]  Prosenjit Bose,et al.  Characterizing and efficiently computing quadrangulations of planar point sets , 1997, Comput. Aided Geom. Des..

[59]  Simeon C. Ntafos,et al.  On Decomposing Polygons into Uniformly Monotone Parts , 1988, Inf. Process. Lett..

[60]  S. Sitharama Iyengar,et al.  TID—a translation invariant data structure for storing images , 1986, CACM.

[61]  Mark Keil,et al.  On covering orthogonal polygons with star-shaped polygons , 1992, Inf. Sci..

[62]  Andreas Brandstädt,et al.  The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions , 1989, FCT.

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

[64]  Rajeev Motwani,et al.  Perfect Graphs and Orthogonally Convex Covers , 1989, SIAM J. Discret. Math..

[65]  Ari Rappoport,et al.  Shape blending using the star-skeleton representation , 1995, IEEE Computer Graphics and Applications.

[66]  David Bremner,et al.  Point visibility graphs and restricted-orientation polygon covering , 1993 .

[67]  Thomas C. Shermer,et al.  Generalized Guarding and Partitioning for Rectilinear Polygons , 1996, Comput. Geom..

[68]  Godfried T. Toussaint,et al.  Converting triangulations to quadrangulations , 1998, Comput. Geom..

[69]  Ervin Győri.  Covering simply connected regions by rectangles , 1985 .

[70]  Azriel Rosenfeld,et al.  Computation of geometric properties from the medial axis transform in (O(nlogn) time , 1986, Comput. Vis. Graph. Image Process..

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

[72]  JOSEPH O’ROURKE,et al.  A new linear algorithm for intersecting convex polygons , 1982, Comput. Graph. Image Process..

[73]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[74]  Teofilo F. Gonzalez,et al.  On Optimal Guillotine Partitions Approximating Optimal D-box Partitions , 1994, Comput. Geom..

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

[76]  Thomas C. Shermer,et al.  Covering and guarding polygons using Lk-sets , 1991 .

[77]  Jörg-Rüdiger Sack,et al.  Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems , 1989, Theor. Comput. Sci..

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

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

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

[81]  Eugene L. Lawler,et al.  Polygon decomposition and perfect graphs , 1988 .

[82]  Teofilo F. Gonzalez,et al.  An efficient divide and conquer approximation algorithm for partitionning into D-boxes , 1993, Int. J. Comput. Geom. Appl..

[83]  Christos Levcopoulos.  Fast heuristics for minimum length rectangular partitions of polygons , 1986, SCG '86.

[84]  Joseph C. Culberson,et al.  Orthogonally Convex Coverings of Orthogonal Polygons without Holes , 1989, J. Comput. Syst. Sci..

[85]  Patrice Belleville.  On Restricted Boundary Covers and Convex Three-Covers , 1993, CCCG.

[86]  David A. Plaisted,et al.  A Heuristic Triangulation Algorithm , 1987, J. Algorithms.

[87]  M. Albertson,et al.  Covering Regions with Squares , 1981 .

[88]  Godfried T. Toussaint,et al.  Quadrangulations of Planar Sets , 1995, WADS.

[89]  David Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

[90]  Rajeev Motwani,et al.  Covering orthogonal polygons with star polygons: the perfect graph approach , 1988, SCG '88.

[91]  B. Chazelle.  Computational geometry and convexity , 1980 .

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

[93]  Alok Aggarwal,et al.  Computational Complexity of Restricted Polygon Decompositions , 1988 .

[94]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .