Advertisement
Published in:
2007 | OriginalPaper | Chapter
k-Colored Point-Set Embeddability of Outerplanar Graphs
Authors : Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath
Published in: Graph Drawing
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. 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.