Abstract
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 P be a path such that |R| vertices of P are red and |B| vertices of P are blue. We study the problem of computing a crossing-free drawing of P such that each blue vertex is represented as a point of B and each red vertex of P is represented as a point of R. We show that such a drawing can always be realized by using at most one bend per edge.
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
Abellanas, M., Garcia-Lopez, J., Hernández-Peñver, G., Noy, M., Ramos, P.A.: Bipartite embeddings of trees in the plane. Discrete Applied Mathematics 93(2-3), 141–148 (1999)
Akiyama, J., Urrutia, J.: Simple alternating path problem. Discrete Mathematics 84, 101–103 (1990)
Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Book-embeddability of series-parallel digraphs. Algorithmica (to appear)
Kaneko, A., Kano, M., Suzuki, K.: Path coverings of two sets of points in the plane. In: Pach, J. (ed.) Towards a Theory of Geometric Graph. Contempory Mathematics, vol. 342. American Mathematical Society, Providence (2004)
Kanenko, A., Kano, M.: Discrete geometry on red and blue points in the plane - a survey. In: Discrete and Computational Geometry. Algorithms and Combinatories, vol. 25. Springer, Heidelberg (2003)
Kaufmann, M., Wiese, R.: Embedding vertices at points: Few bends suffice for planar graphs. Journal of Graph Algorithms and Applications 6(1), 115–129 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Giacomo, E., Liotta, G., Trotta, F. (2006). How to Embed a Path onto Two Sets of Points. In: Healy, P., Nikolov, N.S. (eds) Graph Drawing. GD 2005. Lecture Notes in Computer Science, vol 3843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11618058_11
Download citation
DOI: https://doi.org/10.1007/11618058_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31425-7
Online ISBN: 978-3-540-31667-1
eBook Packages: Computer ScienceComputer Science (R0)