Global roundings of sequences
暂无分享,去创建一个
For a given sequence a = (a1,...,an) of numbers, a global rounding is an integer sequence b = (b1,...,bn) such that the rounding error |Σi ∈ I(ai - bi)| is less than one in all intervals I ⊆ {1,...,n}. We give a simple characterization of the set of global roundings of a. This allows to compute optimal roundings in time O(n log n) and generate a global rounding uniformly at random in linear time under a non-degeneracy assumption and in time O(n log n) in the general case.
[1] Takeshi Tokuyama,et al. Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization , 2002, Theoretical Foundations of Computer Vision.
[2] Kunihiko Sadakane,et al. Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence , 2001, International Colloquium on Automata, Languages and Programming.
[3] Takki Chebihi Nadia. Global rounding and its application to digital halftoning , 2004 .