Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Nonplanar Graph Drawings with k Vertices per Face

    The study of nonplanar graph drawings with forbidden or desired crossing configurations has a long tradition in geometric graph theory, and received an increasing attention in the last two decades, under the n...

    Carla Binucci, Giuseppe Di Battista in Graph-Theoretic Concepts in Computer Scien… (2023)

  2. Chapter and Conference Paper

    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 optimization goal...

    Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato in Graph Drawing (2002)

  3. Chapter and Conference Paper

    Labeling Heuristics for 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 they are not assigned. The opt...

    Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato in Graph Drawing (2002)