Convexity conditions for Powell-Sabin splines are derived and an algorithm is presented for fitting a convex Powell-Sabin spline to a set of scattered data. Part of this algorithm deals with the elimination of as many redundant conditions as possible.