An Optimum Convex Decomposition Algorithm of Simple Polygon Based on Its Adjacent Concave Vertex Connection

Relation of the simple polygon´s adjacent concave vertex and recursive decomposition, we present an optimum algorithm for a convex decomposition of the simple polygon. The algorithm can partition the simple polygon into some convex ones, therefore, not only does the recursion reduce, but also the algorithm becomes more efficient in decomposition than reference 1. Meanwhile, the algorithm is simple and efficient, and has less time complexity.