A polynomial time solution for labeling a rectilinear map

DOI10.1016/S0020-0190(98)00002-7zbMATH Open1339.68278WikidataQ55918916 ScholiaQ55918916MaRDI QIDQ293240FDOQ293240

Authors: Chung Keung Poon, Zhu Binhai, Chin Francis 

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

Recommendations

• Labeling a rectilinear map more efficiently
• LABELING A RECTILINEAR MAP WITH SLIDING LABELS
• Label placement by maximum independent set in rectangles
• Maximizing the Number of Independent Labels in the Plane
• Polynomial time algorithms for three-label point labeling.

zbMATH Keywords

computational geometrymap labeling

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The Problem of Compatible Representatives
• On the Complexity of Timetable and Multicommodity Flow Problems
• Approximate map labeling is in \(\Omega (n\log n)\)
• Title not available (Why is that?)

Cited In (11)

• Title not available (Why is that?)
• LABELING A RECTILINEAR MAP WITH SLIDING LABELS
• A new fast heuristic for labeling points
• Label updating to avoid point-shaped obstacles in fixed model
• Labeling a rectilinear map more efficiently
• Polynomial time algorithms for three-label point labeling.
• Determining a set of maximum inscribed rectangles for label placement in a region
• Optimal point removal in closed-2PM labeling
• Title not available (Why is that?)
• EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING
• Matching points with rectangles and squares

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

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