Abstract
Hamiltonicity, book embeddability, and point-set embedda- bility of planar graphs are strictly related concepts. We exploit the interplay between these notions to describe colored sets of points and to design polynomial-time algorithms to embed k-colored planar graphs on these sets such that the resulting drawings have \(\mathcal{O}(k)\) bends per edge.
Research partially supported by the MIUR Project “MAINSTREAM: Algorithms for massive information structures and data streams”.
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
Badent, M., Di Giacomo, E., Liotta, G.: Drawing colored graphs on colored points. In: Dehne, F.K.H.A., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 102–113. Springer, Heidelberg (2007)
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River, NJ (1999)
Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H., Trotta, F., Wismath, S.K.: k-colored point-set embeddability of outerplanar graphs. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 318–329. Springer, Heidelberg (2007)
Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Curve-constrained drawings of planar graphs. Computational Geometry 30, 1–23 (2005)
Di Giacomo, E., Liotta, G., Trotta, F.: On embedding a graph on two sets of points. IJFCS, Special Issue on Graph Drawing 17(5), 1071–1094 (2006)
Kaneko, A., Kano, M.: Discrete geometry on red and blue points in the plane - a survey. In: Discrete & Computational Geometry, Algorithms and Combinatories, vol. 25, pp. 551–570. Springer, Heidelberg (2003)
Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol. 2025. Springer, Heidelberg (2001)
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)
Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graph and Combinatorics 17, 717–728 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Giacomo, E., Liotta, G., Trotta, F. (2008). Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge. In: Hong, SH., Nishizeki, T., Quan, W. (eds) Graph Drawing. GD 2007. Lecture Notes in Computer Science, vol 4875. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77537-9_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-77537-9_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77536-2
Online ISBN: 978-3-540-77537-9
eBook Packages: Computer ScienceComputer Science (R0)