A physically based approach to 2–D shape blending
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Scheduled Fourier volume morphing
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
On compatible triangulations of simple polygons
Computational Geometry: Theory and Applications
Bernstein-Be´zier polynomials on spheres and sphere-like surfaces
Computer Aided Geometric Design
Warping and morphing of graphical objects
Warping and morphing of graphical objects
How to morph tilings injectively
Journal of Computational and Applied Mathematics
Controllable morphing of compatible planar triangulations
ACM Transactions on Graphics (TOG)
Fundamentals of spherical parameterization for 3D meshes
ACM SIGGRAPH 2003 Papers
Morphing orthogonal planar graph drawings
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Morphing planar graphs while preserving edge directions
GD'05 Proceedings of the 13th international conference on Graph Drawing
| Hi-index | 0.00 |
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.