A polynomial time solution for labeling a rectilinear map

DOI10.1016/S0020-0190(98)00002-7zbMath1339.68278WikidataQ55918916 ScholiaQ55918916MaRDI QIDQ293240

Chin Francis, Chung Keung Poon, Zhu Binhai

Publication date: 9 June 2016

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

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098000027?np=y

zbMATH Keywords

computational geometrymap labeling

Mathematics Subject Classification ID

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

Related Items (8)

Labeling a rectilinear map more efficiently ⋮ Optimal point removal in closed-2PM labeling ⋮ Label updating to avoid point-shaped obstacles in fixed model ⋮ Polynomial time algorithms for three-label point labeling. ⋮ Matching points with rectangles and squares ⋮ EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING ⋮ LABELING A RECTILINEAR MAP WITH SLIDING LABELS ⋮ A new fast heuristic for labeling points

Cites Work

• Unnamed Item
• Unnamed Item
• Approximate map labeling is in \(\Omega (n\log n)\)
• The Problem of Compatible Representatives
• On the Complexity of Timetable and Multicommodity Flow Problems

This page was built for publication: A polynomial time solution for labeling a rectilinear map