Turn-regularity and optimal area drawings of orthogonal representations
Computational Geometry: Theory and Applications
On the complexity of the edge label placement problem
Computational Geometry: Theory and Applications
An Algorithm for Labeling Edges of Hierarchical Drawings
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
An Algorithmic Framework for Visualizing Statecharts
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Labeling Heuristics for Orthogonal Drawings
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Computing Labeled Orthogonal Drawings
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Computing Labeled Orthogonal Drawings
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
A topology-shape-metrics approach for the automatic layout of UML class diagrams
Proceedings of the 2003 ACM symposium on Software visualization
Automatic layout of UML class diagrams in orthogonal style
Information Visualization - Special issue: Software visualization
Human-centered visualization environments
Human-centered visualization environments
| Hi-index | 0.00 |
This paper studies the problem of computing labeled orthogonal drawings. A label is modeled as a rectangle of prescribed size and it can be associated with either a vertex or an edge. Several optimization goals are taken into account. Namely, the labeled drawing can be required to have minimum total edge length, minimum width, minimum height, or minimum area. We present ILP models to compute optimal drawings with respect to the first three objectives and an algorithm exploiting these models which computes a drawing of minimum area (the compaction problem is known to be NP-complete in general).