Disc Covering Problem with Application to Digital Halftoning.
Saved in:
| 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 |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 47410981 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Disc Covering Problem with Application to Digital Halftoning. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Asano%2C+Tetsuo%22">Asano, Tetsuo</searchLink><relatesTo>1</relatesTo><i> t-asano@jaist.ac.jp</i><br /><searchLink fieldCode="AR" term="%22Brass%2C+Peter%22">Brass, Peter</searchLink><relatesTo>2</relatesTo><i> peter@cs.ccny.cuny.edu</i><br /><searchLink fieldCode="AR" term="%22Sasahara%2C+Shinji%22">Sasahara, Shinji</searchLink><relatesTo>3</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Theory+of+Computing+Systems%22">Theory of Computing Systems</searchLink>. Feb2010, Vol. 46 Issue 2, p157-173. 17p. 3 Color Photographs, 3 Black and White Photographs, 6 Diagrams. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Halftone+process%22">Halftone process</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems%22">Computer systems</searchLink><br /><searchLink fieldCode="DE" term="%22Compact+discs%22">Compact discs</searchLink><br /><searchLink fieldCode="DE" term="%22Printing%22">Printing</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=47410981 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s00224-008-9123-0 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 17 StartPage: 157 Subjects: – SubjectFull: Algorithms Type: general – SubjectFull: Halftone process Type: general – SubjectFull: Computer systems Type: general – SubjectFull: Compact discs Type: general – SubjectFull: Printing Type: general Titles: – TitleFull: Disc Covering Problem with Application to Digital Halftoning. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Asano, Tetsuo – PersonEntity: Name: NameFull: Brass, Peter – PersonEntity: Name: NameFull: Sasahara, Shinji IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 02 Text: Feb2010 Type: published Y: 2010 Identifiers: – Type: issn-print Value: 14324350 Numbering: – Type: volume Value: 46 – Type: issue Value: 2 Titles: – TitleFull: Theory of Computing Systems Type: main |
| ResultId | 1 |
