436 research outputs found
Shape Animation with Combined Captured and Simulated Dynamics
We present a novel volumetric animation generation framework to create new
types of animations from raw 3D surface or point cloud sequence of captured
real performances. The framework considers as input time incoherent 3D
observations of a moving shape, and is thus particularly suitable for the
output of performance capture platforms. In our system, a suitable virtual
representation of the actor is built from real captures that allows seamless
combination and simulation with virtual external forces and objects, in which
the original captured actor can be reshaped, disassembled or reassembled from
user-specified virtual physics. Instead of using the dominant surface-based
geometric representation of the capture, which is less suitable for volumetric
effects, our pipeline exploits Centroidal Voronoi tessellation decompositions
as unified volumetric representation of the real captured actor, which we show
can be used seamlessly as a building block for all processing stages, from
capture and tracking to virtual physic simulation. The representation makes no
human specific assumption and can be used to capture and re-simulate the actor
with props or other moving scenery elements. We demonstrate the potential of
this pipeline for virtual reanimation of a real captured event with various
unprecedented volumetric visual effects, such as volumetric distortion,
erosion, morphing, gravity pull, or collisions
Probabilistic and parallel algorithms for centroidal Voronoi tessellations with application to meshless computing and numerical analysis on surfaces
Centroidal Voronoi tessellations (CVT) are Voronoi tessellations of a region such that the generating points of the tessellations are also the centroids of the corresponding Voronoi regions. Such tessellations are of use in very diverse applications, including data compression, clustering analysis, cell biology, territorial behavior of animals, optimal allocation of resources, and grid generation. A detailed review is given in chapter 1. In chapter 2, some probabilistic methods for determining centroidal Voronoi tessellations and their parallel implementation on distributed memory systems are presented. The results of computational experiments performed on a CRAY T3E-600 system are given for each algorithm. These demonstrate the superior sequential and parallel performance of a new algorithm we introduce. Then, new algorithms are presented in chapter 3 for the determination of point sets and associated support regions that can then be used in meshless computing methods. The algorithms are probabilistic in nature so that they are totally meshfree, i.e., they do not require, at any stage, the use of any coarse or fine boundary conforming or superimposed meshes. Computational examples are provided that show, for both uniform and non-uniform point distributions that the algorithms result in high-quality point sets and high-quality support regions. The extensions of centroidal Voronoi tessellations to general spaces and sets are also available. For example, tessellations of surfaces in a Euclidean space may be considered. In chapter 4, a precise definition of such constrained centroidal Voronoi tessellations (CCVT\u27s) is given and a number of their properties are derived, including their characterization as minimizers of a kind of energy. Deterministic and probabilistic algorithms for the construction of CCVT\u27s are presented and some analytical results for one of the algorithms are given. Some computational examples are provided which serve to illustrate the high quality of CCVT point sets. CCVT point sets are also applied to polynomial interpolation and numerical integration on the sphere. Finally, some conclusions are given in chapter 5
A PDE approach to centroidal tessellations of domains
We introduce a class of systems of Hamilton-Jacobi equations that
characterize critical points of functionals associated to centroidal
tessellations of domains, i.e. tessellations where generators and centroids
coincide,
such as centroidal Voronoi tessellations and centroidal power diagrams. An
appropriate version of the Lloyd algorithm, combined with a Fast Marching
method on unstructured grids for the Hamilton-Jacobi equation, allows computing
the solution of the system. We propose various numerical examples to illustrate
the features of the technique
- …