On convex decompositions of a planar point set

Let PP be a planar point set in general position. Neumann-Lara et al. showed that there is a convex decomposition of PP with at most 10n−187 elements. In this paper, we improve this upper bound to ⌈75(n−3)⌉+1.