@inbook{7f92a77e7f6e458fa52f241af7f6f6f9,
title = "Intersection-free morphing of planar graphs",
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.",
author = "Cesim Erten and Kobourov, {Stephen G.} and Chandan Pitta",
year = "2004",
doi = "10.1007/978-3-540-24595-7_30",
language = "English (US)",
isbn = "3540208313",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag",
pages = "320--331",
editor = "Giuseppe Liotta",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
}