Geometry of planar graphs with angles
SCG '86 Proceedings of the second annual symposium on Computational geometry
Rotation distance, triangulations, and hyperbolic geometry
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A physically based approach to 2–D shape blending
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
2-D shape blending: an intrinsic solution to the vertex path problem
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Turtlegons: generating simple polygons for sequences of angles
SCG '85 Proceedings of the first annual symposium on Computational geometry
Skeleton-based modeling operations on solids
SMA '97 Proceedings of the fourth ACM symposium on Solid modeling and applications
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Better Approximation of Diagonal-Flip Transformation and Rotation Transformation
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Proceedings of the twenty-second annual symposium on Computational geometry
Theoretical Computer Science
Interactive surface decomposition for polyhedral morphing
The Visual Computer: International Journal of Computer Graphics
| Hi-index | 0.00 |
In this paper we investigate the problem of morphing (i.e. continuously deforming) one simple polygon into another. We assume that our two initial polygons have the same number of sides n, and that corresponding sides are parallel. We show that a morph is always possible by a varying simple interpolating polygon also of n sides parallel to those of the two original ones. If we consider a uniform scaling or translation of part of the polygon as an atomic morphing step, then we show that O(n4/3+&egr;) such steps are sufficient for the morph.