Maximizing the Number of Independent Labels in the Plane

DOI10.1007/978-3-540-73814-5_13MaRDI QIDQ3612584zbMATH OpenOpenAlexFDO

Authors Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee

Publication date 10 March 2009

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73814-5_13

zbMATH Keywords

cartography

Mathematics Subject Classification ID

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

Recommendations

• Label placement by maximum independent set in rectangles
• Point labeling with sliding labels
• Polynomial time algorithms for three-label point labeling.
• scientific article; zbMATH DE number 2089214
• Optimal algorithm for a special point-labeling problem

Cited in

(10)

• Optimal algorithm for a special point-labeling problem
• Label placement by maximum independent set in rectangles
• Optimal labeling of point features in rectangular labeling models
• A Lagrangean decomposition for the maximum independent set problem applied to map labeling
• A polynomial time solution for labeling a rectilinear map
• Labeling a rectilinear map more efficiently
• scientific article; zbMATH DE number 2089214 (Why is no real title available?)
• scientific article; zbMATH DE number 1796965 (Why is no real title available?)
• Graph Drawing
• An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling

This page was built for publication: Maximizing the Number of Independent Labels in the Plane

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