This paper addresses the problem of designing drawing algorithms that receive as input a planar graph G, a partitioning of the vertices of G into k different semantic categories V0, ⋯ , Vk − 1, and k disjoint sets S0, ⋯ , Sk − 1 of points in the plane with |Vi | = |Si | (i ∈ {0, ⋯ , k − 1}). The desired output is a planar drawing such that the vertices of Vi are mapped onto the points of Si and such that the curve complexity of the edges (i.e. the number of bends along each edge) is kept small. Particular attention is devoted to outerplanar graphs, for which lower and upper bounds on the number of bends in the drawings are established.
K-colored point-set embeddability of outerplanar graphs
DI GIACOMO, Emilio;DIDIMO, WALTER;LIOTTA, Giuseppe;
2007
Abstract
This paper addresses the problem of designing drawing algorithms that receive as input a planar graph G, a partitioning of the vertices of G into k different semantic categories V0, ⋯ , Vk − 1, and k disjoint sets S0, ⋯ , Sk − 1 of points in the plane with |Vi | = |Si | (i ∈ {0, ⋯ , k − 1}). The desired output is a planar drawing such that the vertices of Vi are mapped onto the points of Si and such that the curve complexity of the edges (i.e. the number of bends along each edge) is kept small. Particular attention is devoted to outerplanar graphs, for which lower and upper bounds on the number of bends in the drawings are established.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
