Approximate map labeling is in \(\Omega (n\log n)\)

DOI10.1016/0020-0190(94)90001-9zbMath0938.68869OpenAlexW1600214667MaRDI QIDQ1338784

Frank Wagner

Publication date: 26 February 1996

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90001-9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

A polynomial time solution for labeling a rectilinear map ⋮ POINT SET LABELING WITH SPECIFIED POSITIONS ⋮ An efficient and effective approximation algorithm for the Map Labeling Problem ⋮ Polynomial time algorithms for three-label point labeling. ⋮ A practical map labeling algorithm. ⋮ EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING ⋮ On Map Labeling with Leaders

Cites Work

• The Problem of Compatible Representatives
• On the complexity of computing the measure of ∪[a _i ,b _i ]

This page was built for publication: Approximate map labeling is in \(\Omega (n\log n)\)