Anzeige
Erschienen in:
2007 | OriginalPaper | Buchkapitel
k-Colored Point-Set Embeddability of Outerplanar Graphs
verfasst von : Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath
Erschienen in: Graph Drawing
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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
V
0
, ⋯ ,
V
k
− 1
, and
k
disjoint sets
S
0
, ⋯ ,
S
k
− 1
of points in the plane with |
V
i
| = |
S
i
| (
i
∈ {0, ⋯ ,
k
− 1}). The desired output is a planar drawing such that the vertices of
V
i
are mapped onto the points of
S
i
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.