Disc covering problem with application to digital halftoning

DOI10.1007/S00224-008-9123-0zbMATH Open1214.68462OpenAlexW2099599968MaRDI QIDQ970100FDOQ970100

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

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

zbMATH Keywords

approximation algorithmcomputational geometryVoronoi diagramdigital halftoning

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• A PTAS for a disc covering problem using width-bounded separators
• Computing and Combinatorics
• Digital Straightness, Circularity, and Their Applications to Image Analysis
• Title not available (Why is that?)

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)