Polygon Decomposition

This publication has 66 references indexed in Scilit:

• Characterizing and efficiently computing quadrangulations of planar point sets
  Computer Aided Geometric Design, 1997
• A LINEAR-TIME ALGORITHM FOR COVERING SIMPLE POLYGONS WITH SIMILAR RECTANGLES
  International Journal of Computational Geometry & Applications, 1996
• Convex Decomposition of Polyhedra and Robustness
  SIAM Journal on Computing, 1992
• A linear-time algorithm for computing the voronoi diagram of a convex polygon
  Discrete & Computational Geometry, 1989
• The jump number problem for biconvex graphs and rectangle covers of rectangular regions
  Published by Springer Nature ,1989
• Partitioning a polygonal region into trapezoids
  Journal of the ACM, 1986
• Covering Regions by Rectangles
  SIAM Journal on Algebraic Discrete Methods, 1981
• Covering Regions with Squares
  SIAM Journal on Algebraic Discrete Methods, 1981
• An efficient algorithm for decomposing a polygon into star-shaped polygons
  Pattern Recognition, 1981
• HIERARCHICAL SHAPE DESCRIPTION BASED UPON CONVEX HULLS OF CONCAVITIES
  Journal of Cybernetics, 1980