TY - GEN

T1 - Morphing planar graphs in spherical space

AU - Kobourov, Stephen G.

AU - Landis, Matthew

PY - 2007

Y1 - 2007

N2 - We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continuous and intersection-free morph between two sphere drawings of a maximally planar graph, provided that both sphere drawings have convex inscribed polytopes, where sphere drawings are the spherical equivalent of plane drawings: intersection-free geodesic-arc drawings. In addition, we describe a morphing algorithm along with its implementation. Movies of sample morphs can be found at http://www.cs.arizona.edu/~mlandis/smorph.

AB - We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continuous and intersection-free morph between two sphere drawings of a maximally planar graph, provided that both sphere drawings have convex inscribed polytopes, where sphere drawings are the spherical equivalent of plane drawings: intersection-free geodesic-arc drawings. In addition, we describe a morphing algorithm along with its implementation. Movies of sample morphs can be found at http://www.cs.arizona.edu/~mlandis/smorph.

UR - http://www.scopus.com/inward/record.url?scp=38149101845&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149101845&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-70904-6_30

DO - 10.1007/978-3-540-70904-6_30

M3 - Conference contribution

AN - SCOPUS:38149101845

SN - 9783540709039

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 306

EP - 317

BT - Graph Drawing - 14th International Symposium, GD 2006, Revised Papers

PB - Springer-Verlag

T2 - 14th International Symposium on Graph Drawing, GD 2006

Y2 - 18 September 2006 through 19 September 2006

ER -