Placing Edge Labels by Modifying an Orthogonal Graph Drawing

Kakoulis, Konstantinos G. and Tollis, Ioannis G. (2011) Placing Edge Labels by Modifying an Orthogonal Graph Drawing. In: Graph Drawing 18th International Symposium, GD 2010, September 21-24, 2010 , pp. 395-396(Official URL: http://dx.doi.org/10.1007/978-3-642-18469-7).

Full text not available from this repository.

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.

Item Type: Conference Poster
Additional Information: 10.1007/978-3-642-18469-7
Classifications: P Styles > P.600 Poly-line > P.600.700 Orthogonal
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1227

Actions (login required)

View Item View Item