Combinatorics and algorithms for low-discrepancy roundings of a real sequence

Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama

Research output: Contribution to journalConference articlepeer-review

2 Citations (Scopus)


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 languageEnglish
Pages (from-to)23-36
Number of pages14
JournalTheoretical Computer Science
Issue number1
Publication statusPublished - 2005 Feb 15
EventAutomata, Languages and Programming - Hersonissos, Greece
Duration: 2001 Jul 82001 Jul 12


  • Discrepancy
  • Global roundings

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Combinatorics and algorithms for low-discrepancy roundings of a real sequence'. Together they form a unique fingerprint.

Cite this