Combinatorial and geometric problems related to digital halftoning

Authors:
Tetsuo Asano;Naoki Katoh;Koji Obokata;Takeshi Tokuyama
Affiliations:
JAIST, Tatsunokuchi, Japan;Kyoto University, Kyoto, Japan;JAIST, Tatsunokuchi, Japan;Tohoku Iniversity, Sendai, Japan
Venue:
Proceedings of the 11th international conference on Theoretical foundations of computer vision
Year:
2002

Citing 10
Cited 1

Digital halftoning

Digital halftoning
Digital halftones by dot diffusion

ACM Transactions on Graphics (TOG)
Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Combinatorica - Theory of Computing
Rotated dispersed dither: a new technique for digital halftoning

SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Randomized algorithms

Randomized algorithms
The discrepancy method: randomness and complexity

The discrepancy method: randomness and complexity
Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Modern Digital Halftoning

Modern Digital Halftoning
Optimal roundings of sequences and matrices

Nordic Journal of Computing
How to Color a Checkerboard with a Given Distribution -- Matrix Rounding Achieving Low 2 × 2-Discrepancy

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation

A generalization of magic squares with applications to digital halftoning

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Digital halftoning is a technique to convert a continuous-tone image into a binary image consisting of black and white dots. It is an important technique for printing machines and printers to output an image with few intensity levels or colors which looks similar to an input image. The purposes of this paper are to reveal that there are a number of problems related to combinatorial and computational geometry and to present some solutions or clues to those problems.