An algorithm, based on convex quadratic programming, is proposed to sm
ooth sample histograms. The resulting smoothed histogram remains close
to the original histogram and honors target mean and variance. The al
gorithm is extended to smooth sample scattergrams. The resulting smoot
hed scattergram remains close to the original scattergram shape and th
e two previously smoothed marginal distributions and honors the target
correlation coefficient.