Sciweavers

Share
GD
2003
Springer

Intersection-Free Morphing of Planar Graphs

9 years 5 months ago
Intersection-Free Morphing of Planar Graphs
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 straightline segments, bends, and curves. Our system is implemented in Java and available as an applet at http://gmorph.cs.arizona.edu.
Cesim Erten, Stephen G. Kobourov, Chandan Pitta
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where GD
Authors Cesim Erten, Stephen G. Kobourov, Chandan Pitta
Comments (0)
books