A new approximation algorithm for labeling points with circle pairs

DOI10.1016/J.IPL.2006.04.006zbMath1185.68781OpenAlexW2051593289MaRDI QIDQ845698

Ming-Hui Jiang

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.04.006

zbMATH Keywords

approximation algorithmcircle packingcomputational geometrymap labeling

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (1)

Trimming of graphs, with application to point labeling

Cites Work

• Unnamed Item
• A simple factor-3 approximation for labeling points with circles
• Iterated nearest neighbors and finding minimal polytopes
• A new bound for map labeling with uniform circle pairs
• Algorithms for the multiple label placement problem
• EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING
• A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING
• Static and Dynamic Algorithms for k-Point Clustering Problems
• Algorithms and Computation

This page was built for publication: A new approximation algorithm for labeling points with circle pairs