Labeling Heuristics for Orthogonal Drawings

Binucci, Carla and Didimo, Walter and Liotta, Giuseppe and Nonato, Maddalena (2002) Labeling Heuristics for Orthogonal Drawings. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 139-153(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_12).

Full text not available from this repository.

Abstract

This paper studies the problem of computing an orthogonal drawing of a graph with labels along the edges. Labels are not allowed to overlap with each other or with edges to which they are not assigned. The optimization goal is area minimization. We provide a unified framework that allows to easily design edge labeling heuristics. By using the framework we implemented and experimentally compared several heuristics. The best performing heuristics have been embedded in the topology-shape-metrics approach.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-45848-4_12
Classifications: G Algorithms and Complexity > G.630 Labeling
P Styles > P.600 Poly-line > P.600.700 Orthogonal
URI: http://gdea.informatik.uni-koeln.de/id/eprint/507

Actions (login required)

View Item View Item