JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/8810

Title: Disc Covering Problem with Application to Digital Halftoning
Authors: Asano, Tetsuo
Brass, Peter
Sasahara, Shinji
Keywords: Approximation algorithm
Computational geometry
Digital halftoning
Voronoi diagram
Issue Date: 2010-02
Publisher: Springer
Magazine name: Theory of Computing Systems
Volume: 46
Number: 2
Start page: 157
End page: 173
DOI: 10.1007/s00224-008-9123-0
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.
Rights: This is the author-created version of Springer, Tetsuo Asano, Peter Brass and Shinji Sasahara, Theory of Computing Systems, 46(2), 2010, 157-173. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/s00224-008-9123-0
URI: http://hdl.handle.net/10119/8810
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
C12259.pdf1745KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Contact : Library Information Section, Japan Advanced Institute of Science and Technology