|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/8810
|
| タイトル: | Disc Covering Problem with Application to Digital Halftoning |
| 著者: | Asano, Tetsuo
Brass, Peter
Sasahara, Shinji |
| キーワード: | Approximation algorithm
Computational geometry
Digital halftoning
Voronoi diagram |
| 発行日: | 2010-02 |
| 出版者: | Springer |
| 誌名: | Theory of Computing Systems |
| 巻: | 46 |
| 号: | 2 |
| 開始ページ: | 157 |
| 終了ページ: | 173 |
| DOI: | 10.1007/s00224-008-9123-0 |
| 抄録: | 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 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| C12259.pdf | | 1745Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
