A PTAS for a disc covering problem using width-bounded separators

DOI10.1007/11533719_50MaRDI QIDQ5716969zbMATH OpenOpenAlexFDO

Authors Bin Fu, Yong Tang, Binhai Zhu, Zhixiang Chen

Publication date 11 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11533719

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10) Approximation algorithms (68W25)

Recommendations

• A PTAS for a disc covering problem using width-bounded separators
• Disc covering problem with application to digital halftoning
• An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
• Theory and application of width bounded geometric separators
• Unit disk cover problem in 2D

Cited in

(5)

• A PTAS for a disc covering problem using width-bounded separators
• A PTAS for the Weighted Unit Disk Cover Problem
• Theory and Application of Width Bounded Geometric Separator
• Theory and application of width bounded geometric separators
• Disc covering problem with application to digital halftoning

This page was built for publication: A PTAS for a disc covering problem using width-bounded separators

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