Bipartite embeddings of trees in the plane
Given a tree T on n vertices and a set P of n points in the plane in general position, it is known that T can be straight line embedded in P without crossings. Now imagine the set P is partitioned into two disjoint subsets R and B, and we ask for an embedding of T in P without crossings and with the property that all edges join a point in R (red) and a point in B (blue). In this case we say that T admits a bipartite embedding with respect to the bipartition (R, B). Examples show that the problem in its full generality is not solvable. In view of this fact we consider several embedding problems and study for which bipartitions they can be solved. We present several results that are valid for any bipartition (R, B) in general position, and some other results that hold for particular configurations of points.
KeywordsConvex Hull Span Tree General Position Convex Polygon Degree Sequence
- 2.P. Bose, M. McAllister and J. Snoeyink, Optimal Algorithms to Embed Trees in the Plane, in Proc. Graph Drawing 95, Springer Verlag LNCS Vol. 1027, pp.64–75.Google Scholar
- 3.H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer Verlag (Berlin, 1987).Google Scholar
- 4.A. García and J. Tejel, Dividiendo una nube de puntos en regiones convexas, Actas VI Encuentros de Geometría Computacional, pp. 169–174, 1995.Google Scholar
- 5.Y. Ikebe, M. Perles, A. Tamura and S. Tokunaga, The Rooted Tree Embedding Problem into Points in the Plane, Discrete and Computational Geometry 11 (1994), pp. 51–63.Google Scholar
- 6.J. Pach and J. Töröcsik, Layout of Rooted trees, in Planar Graphs (W.T. Trotter, ed.), DIMACS Series, Vol. 9, Amer. Math. Soc., pp. 131–137.Google Scholar