206 research outputs found
Tetrisation of triangular meshes and its application in shape blending
The As-Rigid-As-Possible (ARAP) shape deformation framework is a versatile
technique for morphing, surface modelling, and mesh editing. We discuss an
improvement of the ARAP framework in a few aspects: 1. Given a triangular mesh
in 3D space, we introduce a method to associate a tetrahedral structure, which
encodes the geometry of the original mesh. 2. We use a Lie algebra based method
to interpolate local transformation, which provides better handling of rotation
with large angle. 3. We propose a new error function to compile local
transformations into a global piecewise linear map, which is rotation invariant
and easy to minimise. We implemented a shape blender based on our algorithm and
its MIT licensed source code is available online
Convexity-Increasing Morphs of Planar Graphs
We study the problem of convexifying drawings of planar graphs. Given any
planar straight-line drawing of an internally 3-connected graph, we show how to
morph the drawing to one with strictly convex faces while maintaining planarity
at all times. Our morph is convexity-increasing, meaning that once an angle is
convex, it remains convex. We give an efficient algorithm that constructs such
a morph as a composition of a linear number of steps where each step either
moves vertices along horizontal lines or moves vertices along vertical lines.
Moreover, we show that a linear number of steps is worst-case optimal.
To obtain our result, we use a well-known technique by Hong and Nagamochi for
finding redrawings with convex faces while preserving y-coordinates. Using a
variant of Tutte's graph drawing algorithm, we obtain a new proof of Hong and
Nagamochi's result which comes with a better running time. This is of
independent interest, as Hong and Nagamochi's technique serves as a building
block in existing morphing algorithms.Comment: Preliminary version in Proc. WG 201
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
On Normals and Control Nets
This paper characterizes when the normals of a spline curve or spline surface lie in the more easily computed cone of the normals of the segments of the spline control net
Analysis of and workarounds for element reversal for a finite element-based algorithm for warping triangular and tetrahedral meshes
We consider an algorithm called FEMWARP for warping triangular and
tetrahedral finite element meshes that computes the warping using the finite
element method itself. The algorithm takes as input a two- or three-dimensional
domain defined by a boundary mesh (segments in one dimension or triangles in
two dimensions) that has a volume mesh (triangles in two dimensions or
tetrahedra in three dimensions) in its interior. It also takes as input a
prescribed movement of the boundary mesh. It computes as output updated
positions of the vertices of the volume mesh. The first step of the algorithm
is to determine from the initial mesh a set of local weights for each interior
vertex that describes each interior vertex in terms of the positions of its
neighbors. These weights are computed using a finite element stiffness matrix.
After a boundary transformation is applied, a linear system of equations based
upon the weights is solved to determine the final positions of the interior
vertices. The FEMWARP algorithm has been considered in the previous literature
(e.g., in a 2001 paper by Baker). FEMWARP has been succesful in computing
deformed meshes for certain applications. However, sometimes FEMWARP reverses
elements; this is our main concern in this paper. We analyze the causes for
this undesirable behavior and propose several techniques to make the method
more robust against reversals. The most successful of the proposed methods
includes combining FEMWARP with an optimization-based untangler.Comment: Revision of earlier version of paper. Submitted for publication in
BIT Numerical Mathematics on 27 April 2010. Accepted for publication on 7
September 2010. Published online on 9 October 2010. The final publication is
available at http://www.springerlink.co
Discretization of the Region of Interest
[EN]The meccano method was recently introduced to construct simultaneously tetrahedral meshes and volumetric parameterizations of solids. The method requires the information of the solid geometry that is defined by its surface, a meccano, i.e., an outline of the solid defined by connected polyhedral pieces, and a tolerance that fixes the desired approximation of the solid surface. The method builds an adaptive tetrahedral mesh of the solid (physical domain) as a deformation of an appropriate tetrahedral mesh of the meccano (parametric domain). The main stages of the procedure involve an admissible mapping between the meccano and the solid boundaries, the nested Kossaczký’s refinement, and our simultaneous untangling and smoothing algorithm. In this chapter, we focus on the application of the method to build tetrahedral meshes over complex terrain, that is interesting for simulation of environmental processes. A digital elevation map of the terrain, the height of the domain, and the required orography approximation are given as input data. In addition, the geometry of buildings or stacks can be considered. In these applications, we have considered a simple cuboid as meccano.Ministerio de Economía y Competitividad, Gobierno de España; Fondos FEDER; Departamento de Educación, Junta de Castilla y León; CONACYT-SENER, Fondo Sectorial CONACYT SENER HIDROCARBUROS
Feature Lines for Illustrating Medical Surface Models: Mathematical Background and Survey
This paper provides a tutorial and survey for a specific kind of illustrative
visualization technique: feature lines. We examine different feature line
methods. For this, we provide the differential geometry behind these concepts
and adapt this mathematical field to the discrete differential geometry. All
discrete differential geometry terms are explained for triangulated surface
meshes. These utilities serve as basis for the feature line methods. We provide
the reader with all knowledge to re-implement every feature line method.
Furthermore, we summarize the methods and suggest a guideline for which kind of
surface which feature line algorithm is best suited. Our work is motivated by,
but not restricted to, medical and biological surface models.Comment: 33 page
- …