Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J. Akiyama and J. Urrutia, Simple Alternating Path Problems, Discrete Mathematics 84 (1990), pp. 101–103.
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.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer Verlag (Berlin, 1987).
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.
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.
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.
A. Tamura and Y. Tamura, Degree Constrained Tree Embedding Into Points in the Plane, Information Proc. Letters 44 (1992), pp. 211–214.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abellanas, M., García, J., Hernández, G., Noy, M., Ramos, P. (1997). Bipartite embeddings of trees in the plane. In: North, S. (eds) Graph Drawing. GD 1996. Lecture Notes in Computer Science, vol 1190. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62495-3_33
Download citation
DOI: https://doi.org/10.1007/3-540-62495-3_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62495-0
Online ISBN: 978-3-540-68048-2
eBook Packages: Springer Book Archive