Automatic graph drawing and readability of diagrams
IEEE Transactions on Systems, Man and Cybernetics
On the thickness of graphs of given degree
Information Sciences: an International Journal
On embedding an outer-planar graph in a point set
Computational Geometry: Theory and Applications
How to embed a path onto two sets of points
GD'05 Proceedings of the 13th international conference on Graph Drawing
Drawing colored graphs on colored points
Theoretical Computer Science
Point-set embeddings of trees with given partial drawings
Computational Geometry: Theory and Applications
Point-set embedding of trees with edge constraints
GD'07 Proceedings of the 15th international conference on Graph drawing
Drawing colored graphs with constrained vertex positions and few bends per edge
GD'07 Proceedings of the 15th international conference on Graph drawing
Drawing colored graphs on colored points
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
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.