Abstract: An Algorithm for finding convex decomposition of simple polygons is described. This algorithm finds the convex hull of a simple polygon and then recurses to find the convex hull of the original region and its convex hull until such regions are convex. The time complexity of the algorithm is proved to be O(n²), where N is the number of edges of the original polygon.