A Software System for Computing Labeled Orthogonal Drawings of Graphs

n/

Computing Labeled Orthogonal Drawings

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 additional optimization goals are taken into account. Namely, the labeled drawing can be required to have either minimum total edge length, or minimum width, or minimum height, or minimum area. We present ILP models to compute optimal drawings with respect to the first three requirements and an algorithm that is based on these models and computes a drawing of minimum area (the compaction problem is known to be NP-complete in general). We also exhibit different heuristics for computing compact labeled orthogonal drawings and experimentally validate their performance