We investigate the problem to round a given [0]
Of a broader interest might be our rounding scheme, which is a modification of randomized rounding. Instead of independently
rounding the variables (expected error 0.82944 per box in the worst case), we impose a number of suitable dependencies.
Experimental results show that roundings obtained by our approach look much less grainy than by independent randomized rounding,
and only slightly more grainy than by error diffusion. On the other hand, the latter algorithm (like all known deterministic
algorithms) tends to produce unwanted structures, a problem that randomized algorithms like ours are unlikely to encounter.
Keywords Randomized rounding - discrepancy - digital halftoning