Abstract
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morphing of planar graphs. Our algorithm uses a combination of different techniques to achieve smooth transformations: rigid morphing, compatible triangulations, as well as morphing based on interpolation of the convex representations of the graphs. Our algorithm can morph between drawings with straight-line segments, bends, and curves. Our system is implemented in Java and available as an applet at http://gmorph.cs.arizona.edu. © Springer-Verlag 2004.
Cite
CITATION STYLE
Erten, C., Kobourov, S. G., & Pitta, C. (2004). Intersection-free morphing of planar graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2912, 320–331. https://doi.org/10.1007/978-3-540-24595-7_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
