Computational geometric and combinatorial approaches to digital halftoning

Authors:
Tetsuo Asano
Affiliations:
JAIST (Japan Advanced Institute of Science and Technology), Nomi, Ishikawa, Japan
Venue:
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Year:
2006

Citing 2
Cited 0

The structure and number of global roundings of a graph

Theoretical Computer Science - Special papers from: COCOON 2003
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. In this talk I will explain how computational geometry and combinatorial optimization can contribute to digital halftoning or what geometric and combinatorial problems are related to digital halftoning (Aronov et al. 2004, Asano et al. 2004).