Abstract
Two straight-line drawings P,Q of a graph (V,E) are called parallel if, for every edge (u,v) ∈ E, the vector from u to v has the same direction in both P and Q. We study problems of the form: given simple, parallel drawings P,Q does there exist a continuous transformation between them such that intermediate drawings of the transformation remain simple and parallel with P (and Q)? We prove that a transformation can always be found in the case of orthogonal drawings; however, when edges are allowed to be in one of three or more slopes the problem becomes NP-hard.
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
Aronov, B., Seidel, R., Souvaine, D.: On compatible triangulations of simple polygons. Computational Geometry: Theory and Applications 3, 27–35 (1992)
Barequet, G., Sharir, M.: Piecewise-linear interpolation between polygonal slices. Comput. Vis. Image Underst. 63(2), 251–272 (1996)
Biedl, T., Lubiw, A., Spriggs, M.: Parallel morphing of trees and cycles. In: 15th Canadian Conference on Computational Geometry (CCCG), pp. 29–32 (2003)
Biedl, T., Lubiw, A., Spriggs, M.J.: Angles and lengths in reconfigurations of polygons and polyhedra. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 748–759. Springer, Heidelberg (2004)
Biedl, T., Lubiw, A., Spriggs, M.J.: Angles and lengths in reconfigurations of polygons and polyhedra, long version (2005), See: http://arxiv.org/
Branke, J.: Dynamic graph drawing. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol. 2025, pp. 228–246. Springer, Heidelberg (2001)
Bridgeman, S., Tamassia, R.: Difference metrics for interactive orthogonal graph drawing algorithms. Journal of Graph Algorithms and Applications 4(3), 47–74 (2000)
Bridgeman, S.S., Di Battista, G., Didimo, W., Liotta, G., Tamassia, R., Vismara, L.: Turn-regularity and optimal area drawings of orthogonal representations. Computational Geometry 16(1), 53–93 (2000)
Cairns, S.S.: Deformations of plane rectilinear complexes. American Math. Monthly 51, 247–252 (1944)
Cantarella, J., Demaine, E.D., Iben, H., O’Brien, J.: An energy-driven approach to linkage unfolding. In: 20th Annual ACM Symposium on Computational Geometry, pp. 134–143 (2004)
Erten, C., Kobourov, S., Pitta, C.: Intersection-free morphing of planar graphs. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 320–331. Springer, Heidelberg (2004)
Erten, C., Kobourov, S., Pitta, C.: Morphing planar graphs. In: 20th Annual ACM Symposium on Computational Geometry, pp. 451–452 (2004)
Floater, M., Gotsman, C.: How to morph tilings injectively. Journal of Computational and Applied Mathematics 101, 117–129 (1999)
Friedrich, C., Eades, P.: Graph drawing in motion. Journal of Graph Algorithms and Applications 6(3), 353–370 (2002)
Friedrich, C., Houle, M.E.: Graph drawing in motion II. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 220–231. Springer, Heidelberg (2002)
Gomes, J., Darsa, L., Costa, B., Velho, L.: Warping and Morphing of Graphical Objects. Morgan Kaufmann, San Francisco (1999)
Gotsman, C., Surazhsky, V.: Guaranteed intersection-free polygon morphing. Computers and Graphics 25, 67–75 (2001)
Grenander, U., Chow, Y., Keenan, D.M.: Hands: A Pattern Theoretic Study of Biological Shapes (Appendix D). Springer, Heidelberg (1991)
Guibas, L., Hershberger, J., Suri, S.: Morphing simple polygons. Discrete and Computational Geometry 24(1), 1–34 (2000)
Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. Wiley, Chichester (1990)
Lubiw, A., Petrick, M., Spriggs, M.J.: Morphing orthogonal planar graph drawings. In: Proceedings ACM-SIAM Symposium on Discrete Algorithms (2006) (to appear)
Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. J. Visual Lang. Comput. 6(2), 183–210 (1995)
Thomassen, C.: Deformations of plane graphs. Journal of Combinatorial Theory Series B: 34, 244–257 (1983)
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
Biedl, T., Lubiw, A., Spriggs, M.J. (2006). Morphing Planar Graphs While Preserving Edge Directions. 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_2
Download citation
DOI: https://doi.org/10.1007/11618058_2
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)