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). © Springer-Verlag Berlin Heidelberg 2002.
CITATION STYLE
Binucci, C., Didimo, W., Liotta, G., & Nonato, M. (2002). Computing labeled orthogonal drawings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2528 LNCS, pp. 66–73). Springer Verlag. https://doi.org/10.1007/3-540-36151-0_7
Mendeley helps you to discover research relevant for your work.