Disc covering problem with application to digital halftoning

DOI10.1007/S00224-008-9123-0MaRDI QIDQ970100zbMATH OpenOpenAlexFDO

Authors Tetsuo Asano, Peter Brass, Shinji Sasahara

Publication date 10 May 2010

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-008-9123-0

zbMATH Keywords

approximation algorithmcomputational geometrydigital halftoningVoronoi diagram

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• A PTAS for a disc covering problem using width-bounded separators
• Computing and Combinatorics
• scientific article; zbMATH DE number 1958099
• An exact algorithm for a class of geometric set-cover problems
• An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem

Cites work

• Optimal roundings of sequences and matrices
• Packing up to 50 equal circles in a square

Cited in

(4)

• A PTAS for a disc covering problem using width-bounded separators
• scientific article; zbMATH DE number 1958099 (Why is no real title available?)
• Digital straightness, circularity, and their applications to image analysis
• Computing and Combinatorics

This page was built for publication: Disc covering problem with application to digital halftoning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970100)