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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Kobourov, S. G., & Landis, M. (2007). Morphing planar graphs in spherical space. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4372 LNCS, pp. 306–317). Springer Verlag. https://doi.org/10.1007/978-3-540-70904-6_30
Mendeley helps you to discover research relevant for your work.