On Embedding a Graph on Two Sets of Points

Let R and B be two sets of points such that the points of R are colored red and the points of B are colored blue. Let G be a planar graph such that |R| vertices of G are red and |B| vertices of G are blue. A bichromatic point-set embedding of G on R ∪ B is a crossing-free drawing of G such that each blue vertex is mapped to a point of B, each red vertex is mapped to a point of R, and each edge is a polygonal curve. We study the curve complexity of bichromatic point-set embeddings; i.e., the number of bends per edge that are necessary and sufficient to compute such drawings. We show that O(n) bends are sometimes necessary. We also prove that two bends per edge suffice if G is a 2-colored caterpillar and that for properly 2-colored caterpillars, properly 2-colored wreaths, 2-colored paths, and 2-colored cycles the number of bends per edge can be reduced to one, which is worst-case optimal.

[1]  Prosenjit Bose,et al.  Journal of Graph Algorithms and Applications , 2022 .

[2]  Shin-ichi Tokunaga.  On a straight-line embedding problem of graphs , 1996, Discret. Math..

[3]  Hikoe Enomoto,et al.  Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine , 1999, SIAM J. Discret. Math..

[4]  Mikio Kano,et al.  Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane , 2000, Int. J. Comput. Geom. Appl..

[5]  Emilio Di Giacomo,et al.  Book Embeddability of Series–Parallel Digraphs , 2006, Algorithmica.

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

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

[8]  Jorge Urrutia,et al.  Simple alternating path problem , 1990, Discret. Math..

[9]  Hikoe Enomoto,et al.  Lower Bounds for the Number of Edge-crossings Over the Spine in a Topological Book Embedding of a Graph , 1999, Discret. Appl. Math..

[10]  Atsushi Kaneko,et al.  Path Coverings of Two Sets of Points in the Plane , .

[11]  Miki Miyauchi.  An O(mn) Algorithm for Embedding Graphs into a 3-Page Book (Special Section on the 6th Karuizawa Workshop on Circuits and Systems) , 1994 .

[12]  Emilio Di Giacomo,et al.  How to Embed a Path onto Two Sets of Points , 2005, Graph Drawing.

[13]  Miki Miyauchi Shimabara.  Trade off between Page Number and Number of Edge-Crossings on the Spine of Book Embeddings of Graphs , 2000 .

[14]  Hazel Everett,et al.  A Visibility Representation for Graphs in Three Dimensions , 1998, J. Graph Algorithms Appl..

[15]  Emilio Di Giacomo,et al.  Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs , 2002, GD.

[16]  John H. Halton,et al.  On the thickness of graphs of given degree , 1991, Inf. Sci..

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

[18]  David R. Wood,et al.  Stacks, Queues and Tracks: Layouts of Graph Subdivisions , 2005, Discret. Math. Theor. Comput. Sci..

[19]  Mikio Kano,et al.  Straight-line embeddings of three rooted trees in the plane , 1998, CCCG.

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

[21]  Ioannis G. Tollis,et al.  Graph Drawing , 1994, Lecture Notes in Computer Science.

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