A new bound for map labeling with uniform circle pairs

DOI10.1016/S0020-0190(01)00184-3zbMath1046.68133OpenAlexW1977735122MaRDI QIDQ1847377

J. Mark Keil, Michael J. Spriggs

Publication date: 24 June 2003

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00184-3

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

A new approximation algorithm for labeling points with circle pairs ⋮ A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING ⋮ Polynomial time algorithms for three-label point labeling.

Cites Work

• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Point set labeling with specified positions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new bound for map labeling with uniform circle pairs