Bibliographic Details
| Title: |
Disc Covering Problem with Application to Digital Halftoning. |
| Authors: |
Asano, Tetsuo1 t-asano@jaist.ac.jp, Brass, Peter2 peter@cs.ccny.cuny.edu, Sasahara, Shinji3 |
| Source: |
Theory of Computing Systems. Feb2010, Vol. 46 Issue 2, p157-173. 17p. 3 Color Photographs, 3 Black and White Photographs, 6 Diagrams. |
| Subjects: |
Algorithms, Halftone process, Computer systems, Compact discs, Printing |
| Abstract: |
This paper considers the following geometric optimization problem: Input is a matrix R=( r ij). Each entry r ij represents a radius of a disc with its center at ( i, j) in the plane. We want to choose discs in such a way that the total area covered by exactly one disc is maximized. This problem is closely related to digital halftoning, a technique to convert a continuous-tone image into a binary image for printing. An exact algorithm is given for the one-dimensional version of the problem while approximation algorithms are given for the two-dimensional one. The approximation algorithms are verified to be satisfactory in practice through experiments in applications to digital halftoning. [ABSTRACT FROM AUTHOR] |
|
Copyright of Theory of Computing Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
