On convex decompositions of a planar point set

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