An Efficiently Computable Metric for Comparing Polygonal Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
As-rigid-as-possible shape interpolation
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Interactive mesh fusion based on local 3D metamorphosis
Proceedings of the 1999 conference on Graphics interface '99
Controllable morphing of compatible planar triangulations
ACM Transactions on Graphics (TOG)
Shape Averaging and it's Applications to Industrial Design
IEEE Computer Graphics and Applications
Shape Blending Using the Star-Skeleton Representation
IEEE Computer Graphics and Applications
Polymorph: Morphing Among Multiple Images
IEEE Computer Graphics and Applications
Multiresolution Interpolation Meshes
PG '01 Proceedings of the 9th Pacific Conference on Computer Graphics and Applications
| Hi-index | 0.01 |
This paper presents a new method for smoothly blending among multiple polygonal shapes. The blended shape is computed as a weighted average of the input shapes. The weight of each input shape is allowed to vary across the shape. This feature increases the flexibility for controlling the local appearance of the blended shapes. Our method computes the blended shape hierarchically, starting from the coarse version of the shape and adding the details gradually. Several examples are shown to demonstrate the advantages of the proposed method.