815 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
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
How to Walk Your Dog in the Mountains with No Magic Leash
We describe a -approximation algorithm for computing the
homotopic \Frechet distance between two polygonal curves that lie on the
boundary of a triangulated topological disk. Prior to this work, algorithms
were known only for curves on the Euclidean plane with polygonal obstacles.
A key technical ingredient in our analysis is a -approximation
algorithm for computing the minimum height of a homotopy between two curves. No
algorithms were previously known for approximating this parameter.
Surprisingly, it is not even known if computing either the homotopic \Frechet
distance, or the minimum height of a homotopy, is in NP
Hierarchical representation of 2D polygons based on approximate skeletons
No abstract availabl
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
Towards compatible triangulations
AbstractWe state the following conjecture: any two planar n-point sets that agree on the number of convex hull points can be triangulated in a compatible manner, i.e., such that the resulting two triangulations are topologically equivalent. We first describe a class of point sets which can be triangulated compatibly with any other set (that satisfies the obvious size and shape restrictions). The conjecture is then proved true for point sets with at most three interior points. Finally, we demonstrate that adding a small number of extraneous points (the number of interior points minus three) always allows for compatible triangulations. The linear bound extends to point sets of arbitrary size and shape
Recommended from our members
PDE Face: A Novel 3D Face Model
YesWe introduce a novel approach to face models, which
exploits the use of Partial Differential Equations (PDE) to
generate the 3D face. This addresses some common
problems of existing face models. The PDE face benefits
from seamless merging of surface patches by using only a
relatively small number of parameters based on boundary
curves. The PDE face also provides users with a great
degree of freedom to individualise the 3D face by
adjusting a set of facial boundary curves. Furthermore, we
introduce a uv-mesh texture mapping method. By
associating the texels of the texture map with the vertices
of the uv mesh in the PDE face, the new texture mapping
method eliminates the 3D-to-2D association routine in
texture mapping. Any specific PDE face can be textured
without the need for the facial expression in the texture
map to match exactly that of the 3D face model
- âŠ