Minimum Decompositions of Polygonal Objects

This publication has 21 references indexed in Scilit:

• An efficient algorith for determining the convex hull of a finite planar set
  Published by Elsevier ,2002
• Some NP-hard polygon decomposition problems
  IEEE Transactions on Information Theory, 1983
• On a convex hull algorithm for polygons and its application to triangulation problems
  Pattern Recognition, 1982
• Planar Formulae and Their Uses
  SIAM Journal on Computing, 1982
• On the complexity of finding the convex hull of a set of points
  Discrete Applied Mathematics, 1982
• The power of non-rectilinear holes
  Published by Springer Nature ,1982
• 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
• A linear algorithm for finding the convex hull of a simple polygon
  Information Processing Letters, 1979
• Analysis of set patterns
  Pattern Recognition, 1968