Universal Pointsets for 2-Coloured Trees

Let R and B be two sets of distinct points such that the points of R are coloured red and the points of B are coloured blue. Let G be a family of planar graphs such that for each graph in the family |R| vertices are red and |B| vertices are blue. The set R∪B is a universal pointset for G if every graph G ∈ G has a straight-line planar drawing such that the blue vertices of G are mapped to the points of B and the red vertices of G are mapped to the points of R. In this paper we describe universal pointsets for meaningful classes of 2-coloured trees and show applications of these results to the coloured simultaneous geometric embeddability problem.

[1]  Hazel Everett,et al.  Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices , 2010, Discret. Comput. Geom..

[2]  Ulrik Brandes,et al.  Colored Simultaneous Geometric Embeddings , 2007, COCOON.

[3]  Emilio Di Giacomo,et al.  k -Colored Point-Set Embeddability of Outerplanar Graphs , 2006, Graph Drawing.

[4]  Emilio Di Giacomo,et al.  Point-set embeddings of trees with given partial drawings , 2009, Comput. Geom..

[5]  Mikio Kano,et al.  Straight-Line Embeddings of Two Rooted Trees in the Plane , 1999, Discret. Comput. Geom..

[6]  Mikio Kano,et al.  Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted Forests , 2005, Int. J. Comput. Geom. Appl..

[7]  Emilio Di Giacomo,et al.  k-colored Point-set Embeddability of Outerplanar Graphs , 2008, J. Graph Algorithms Appl..

[8]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[9]  Micha A. Perles,et al.  The rooted tree embedding problem into points in the plane , 1994, Discret. Comput. Geom..

[10]  János Pach,et al.  Embedding Planar Graphs at Fixed Vertex Locations , 1998, GD.

[11]  Emilio Di Giacomo,et al.  On Embedding a Graph on Two Sets of Points , 2006, Int. J. Found. Comput. Sci..

[12]  Mikio Kano,et al.  Straight line embeddings of rooted star forests in the plane , 2000, Discret. Appl. Math..

[13]  R. Pollack,et al.  Embedding a planar triangulation with vertices at specified points , 1991 .

[14]  Stephen G. Kobourov,et al.  Colored Simultaneous Geometric Embeddings and Universal Pointsets , 2011, Algorithmica.

[15]  Marc Noy,et al.  Bipartite Embeddings of Trees in the Plane , 1999, Discret. Appl. Math..

[16]  Emilio Di Giacomo,et al.  Drawing colored graphs on colored points , 2007, Theor. Comput. Sci..