… , such as drawing UML diagrams and ER-diagrams. – We describe a strategy … computing
a labeled orthogonal drawing with minimum area among those preserving a given orthogonal …

… models to compute optimal drawings with respect … compute a labeled drawing of minimum
area. We also present several heuristics for computing compact labeled orthogonal drawings …

… 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 …

… We describe a fast orthogonal drawing approach which implements the so-called three-phase …
which is used to derive a network flow formulation for computing Kandinsky drawings. …

… 2D approach for computing an orthogonal drawing separates the task of defining the shape
of the drawing from the task of computing its … (b) A graph G and a labeling for its darts. (c) An …

… labeling algorithm for orthogonal drawings is obtained, where the layout is done with
respect to the realization of the labeling… for computing bend-minimum orthogonal drawings. …

… [4] for constructing an orthogonal drawing of a planar graph in … an orthogonal representation
of the input graph, ie a labeling … one exists), we compute simple drawings for the connecting …

… We investigate computational complexity … labeling and the layout of orthogonal drawings
is presented in [4]. The authors study the problem of computing a grid drawing of an orthogonal …

… Besides each planar embedding we show the orthogonal drawing (edges are mapped to …
Namely, (1) f is labeled L if we turn left; (2) f is labeled R if we turn right; (3) f is labeled LL when …

… orthogonal grid drawing of G that preserves the embedding. … Since we deal with orthogonal
drawings, we will measure … each face, which is used in the proof of Lemma 1, is labeled. …