Placing edge labels by modifying an orthogonal graph drawing

Authors:
Konstantinos G. Kakoulis;Ioannis G. Tollis
Affiliations:
Dept. of Industrial Design Engineering, T.E.I. of West Macedonia, Greece;Dept. of Computer Science, University of Crete and FORTH-ICS, Crete, Greece
Venue:
GD'10 Proceedings of the 18th international conference on Graph drawing
Year:
2010

Citing 2
Cited 0

On the complexity of the edge label placement problem

Computational Geometry: Theory and Applications
Orthogonal drawings of graphs with vertex and edge labels

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate how one can modify an orthogonal graph drawing to accommodate the placement of overlap-free labels with the minimum cost. We present a polynomial time algorithm that finds the minimum increase of space in one direction, needed to resolve overlaps, while preserving the orthogonal representation of the drawing.