Modifying orthogonal drawings for label placement

DOI10.3390/A9020022zbMath1461.68155OpenAlexW2311124100MaRDI QIDQ1736777

Konstantinos G. Kakoulis, Ioannis. G. Tollis

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a9020022

zbMATH Keywords

NP-hardgraph drawinggraph labelingedge labelingautomated label placementorthogonal drawings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for drawing graphs: An annotated bibliography
• Algorithms for area-efficient orthogonal drawing
• Orthogonal drawings of graphs with vertex and edge labels
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Interactive orthogonal graph drawing
• A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• On the complexity of the Edge Label Placement problem

This page was built for publication: Modifying orthogonal drawings for label placement