Computational geometry: an introduction
Computational geometry: an introduction
Constrained Delaunay triangulations
SCG '87 Proceedings of the third annual symposium on Computational geometry
A physically based approach to 2–D shape blending
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Topological evolution of surfaces
GI '96 Proceedings of the conference on Graphics interface '96
Three-dimensional distance field metamorphosis
ACM Transactions on Graphics (TOG)
Warping and morphing of graphical objects
Warping and morphing of graphical objects
Shape transformation using variational implicit functions
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Shape Blending Using the Star-Skeleton Representation
IEEE Computer Graphics and Applications
Morphing many polygons across a change in topology
Morphing many polygons across a change in topology
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry: Theory and Applications
Interactive rubber-sheeting using dynamic triangulation
ACM SIGGRAPH 2006 Research posters
| Hi-index | 0.00 |
We present a new object-based algorithm for morphing between two shapes with an arbitrary number of polygons and arbitrarily different topology. Many solutions have been proposed for morphing between two polygons. However, there has been little attention to morphing between different numbers of polygons, across a change in topology. A modified conforming Delaunay triangulation is used to build the vertex correspondence. Polygon evolution is used to smooth the morph. The morph requires no user interaction, avoids self-intersection, uses dynamic vertex correspondence, and follows nonlinear vertex paths.