Algorithms for the multiple label placement problem

DOI10.1016/j.comgeo.2006.03.005zbMath1102.65025OpenAlexW2000417397MaRDI QIDQ2432730

Konstantinos G. Kakoulis, Ioannis. G. Tollis

Publication date: 25 October 2006

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.03.005

zbMATH Keywords

cartographyalgorithmsnumerical examplesgraph drawingmap labelingautomated label placement

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

A new approximation algorithm for labeling points with circle pairs

Uses Software

• LEDA

Cites Work

• Efficient algorithms for counting and reporting pairwise intersections between convex polygons
• Polynomial time algorithms for three-label point labeling.
• An experimental comparison of four graph drawing algorithms.
• A new approach to rectangle intersections part I
• A new approach to rectangle intersections
• A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT
• On the complexity of the Edge Label Placement problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for the multiple label placement problem