## Abstract

We discuss the problem of computing all the integer sequences obtained by rounding an input sequence of n real numbers such that the discrepancy between the input sequence and each output binary sequence is less than one. The problem arises in the design of digital halftoning methods in computer graphics. We show that the number of such roundings is at most n+1 if we consider the discrepancy with respect to the set of all subintervals, and give an efficient algorithm to report all of them. Then, we give an optimal method to construct a compact graph to represent the set of global roundings satisfying a weaker discrepancy condition.

Original language | English |
---|---|

Pages (from-to) | 23-36 |

Number of pages | 14 |

Journal | Theoretical Computer Science |

Volume | 331 |

Issue number | 1 |

DOIs | |

Publication status | Published - 2005 Feb 15 |

Event | Automata, Languages and Programming - Hersonissos, Greece Duration: 2001 Jul 8 → 2001 Jul 12 |

## Keywords

- Discrepancy
- Global roundings

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)