1,335 research outputs found
Morphing of Triangular Meshes in Shape Space
We present a novel approach to morph between two isometric poses of the same
non-rigid object given as triangular meshes. We model the morphs as linear
interpolations in a suitable shape space . For triangulated 3D
polygons, we prove that interpolating linearly in this shape space corresponds
to the most isometric morph in . We then extend this shape space
to arbitrary triangulations in 3D using a heuristic approach and show the
practical use of the approach using experiments. Furthermore, we discuss a
modified shape space that is useful for isometric skeleton morphing. All of the
newly presented approaches solve the morphing problem without the need to solve
a minimization problem.Comment: Improved experimental result
Assessment criteria for 2D shape transformations in animation
The assessment of 2D shape transformations (or morphing) for animation is a difficult task because it is a multi-dimensional problem. Existing morphing techniques pay most attention to shape information interactive control and mathematical simplicity. This paper shows that it is not enough to use shape information alone, and we should consider other factors such as structure, dynamics, timing, etc. The paper also shows that an overall objective assessment of morphing is impossible because factors such as timing are related to subjective judgement, yet local objective assessment criteria, e.g. based on shape, are available. We propose using “area preservation” as the shape criterion for the 2D case as an acceptable approximation to “volume preservation” in reality, and use it to establish cases in which a number of existing techniques give clearly incorrect results. The possibility of deriving objective assessment criteria for dynamics simulations and timing under certain conditions is discussed
On contractible edges in convex decompositions
Let be a convex decomposition of a set of points in
general position in the plane. If consists of more than one polygon, then
either contains a deletable edge or contains a contractible edge
Mean value coordinates–based caricature and expression synthesis
We present a novel method for caricature synthesis based on mean value coordinates (MVC). Our method can be applied to any single frontal face image to learn a specified caricature face pair for frontal and 3D caricature synthesis. This technique only requires one or a small number of exemplar pairs and a natural frontal face image training set, while the system can transfer the style of the exemplar pair across individuals. Further exaggeration can be fulfilled in a controllable way. Our method is further applied to facial expression transfer, interpolation, and exaggeration, which are applications of expression editing. Additionally, we have extended our approach to 3D caricature synthesis based on the 3D version of MVC. With experiments we demonstrate that the transferred expressions are credible and the resulting caricatures can be characterized and recognized
Optimal Morphs of Convex Drawings
We give an algorithm to compute a morph between any two convex drawings of
the same plane graph. The morph preserves the convexity of the drawing at any
time instant and moves each vertex along a piecewise linear curve with linear
complexity. The linear bound is asymptotically optimal in the worst case.Comment: To appear in SoCG 201
- …