Drawing colored graphs on colored points

https://doi.org/10.1016/j.tcs.2008.08.004Get rights and content
Under an Elsevier user license
open archive

Abstract

Let G be a planar graph with n vertices and with a partition of the vertex set into subsets V0,,Vk1 for some positive integer 1kn. Let S be a set of n distinct points in the plane with a partition into subsets S0,,Sk1 with Vi=Si (0ik1). This paper studies the problem of computing a planar polyline drawing of G, such that each vertex of Vi is mapped to a distinct point of Si. Lower and upper bounds on the number of bends per edge are proved for any 2kn. In the special case k=n, we improve the upper and lower bounds presented in a paper by Pach and Wenger [J. Pach, R. Wenger, Embedding planar graphs at fixed vertex locations, Graphs and Combinatorics 17 (2001) 717–728]. The upper bound is based on an algorithm for computing a topological book embedding of a planar graph, such that the vertices follow a given left-to-right order and the number of crossings between every edge and the spine is asymptotically optimal, which can be regarded as a result of independent interest.

Keywords

Graph drawing
Computational geometry
Point-set embedding
Graph Hamiltonicity

Cited by (0)

An extended abstract of this paper appeared in the proceedings of the 10th Workshop on Algorithms and Data Structures, WADS 2007. Work partially supported by the MIUR Project “MAINSTREAM: Algorithms for massive information structures and data streams”.