The 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 this framework, we implement and experimentally compare several heuristics. The best performing ones have been embedded in the topology-shape-metrics approach.
Labeling heuristics for orthogonal drawings
NONATO, Maddalena
2001
Abstract
The 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 this framework, we implement and experimentally compare several heuristics. The best performing ones have been embedded in the topology-shape-metrics approach.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
