Related papers: Relaxed Scheduling in Dynamic Skin Triangulation
We introduce a new structure preserving, second order in time relaxation-type scheme for approximating solutions of the Schr\"odinger-Poisson system. More specifically, we use the Crank-Nicolson scheme as a time stepping mechanism, whilst…
In this paper, we present the numerical solution of two-phase flow problems of engineering significance with a space-time finite element method that allows for local temporal refinement. Our basis is the method presented in [3], which…
The I-patch is a multi-sided surface representation, defined as a combination of implicit ribbon and bounding surfaces, whose pairwise intersections determine the natural boundaries of the patch. Our goal is to show how a collection of…
We propose an approach based on convex relaxations for certifiably optimal robust multiview triangulation. To this end, we extend existing relaxation approaches to non-robust multiview triangulation by incorporating a truncated least…
Building animatable and editable models of clothed humans from raw 3D scans and poses is a challenging problem. Existing reposing methods suffer from the limited expressiveness of Linear Blend Skinning (LBS), require costly mesh extraction…
Recent years have witnessed significant progress in the field of neural surface reconstruction. While the extensive focus was put on volumetric and implicit approaches, a number of works have shown that explicit graphics primitives such as…
An elastic surface model is investigated by using the canonical Monte Carlo simulation technique on triangulated spherical meshes. The model undergoes a first-order collapsing transition and a continuous surface fluctuation transition. The…
The notions of discrete conformality on triangle meshes have rich mathematical theories and wide applications. The related notions of discrete uniformizations on triangle meshes, suggest efficient methods for computing the uniformizations…
Motivated by the need for adaptive, secure and responsive scheduling in a great range of computing applications, including human-centered and time-critical applications, this paper proposes a scheduling framework that seamlessly adds…
A new relaxation approach is proposed which allows for the description of stress- and strain-softening at finite strains. The model is based on the construction of a convex hull replacing the originally non-convex incremental stress…
We present a new method to bake classical facial animation blendshapes into a fast linear blend skinning representation. Previous work explored skinning decomposition methods that approximate general animated meshes using a dense set of…
Artificial skin with the sense of touch can support robots to interact with the surrounding environment efficiently and accomplish complex tasks. Traditional multi-layered artificial skins require complex manufacturing processes which can…
We propose a reduced-space elasto-dynamic solver that is well suited for augmenting rigged character animations with secondary motion. At the core of our method is a novel deformation subspace based on Linear Blend Skinning that overcomes…
The integration of algorithmic components into neural architectures has gained increased attention recently, as it allows training neural networks with new forms of supervision such as ordering constraints or silhouettes instead of using…
Biomembranes adopt varying morphologies that are vital to cellular functions. Many studies use computational modeling to understand how various mechanochemical factors contribute to membrane shape transformations. Compared to…
Texture reconstruction techniques generally suffer from the errors in keyframe poses. We present a non-iterative method for seamless texture reconstruction of a given 3D scene. Our method finds the best texture alignment in a single shot…
In collaborative robotic applications, human and robot have to work together during a whole shift for executing a sequence of jobs. The performance of the human robot team can be enhanced by scheduling the right tasks to the human and the…
This paper addresses the problem of improving the query performance of the triangular expansion algorithm (TEA) for computing visibility regions by finding the most advantageous instance of the triangular mesh, the preprocessing structure.…
Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagram). This is useful for certain numerical algorithms that prefer such primal-dual mesh pairs. We prove that well-centered meshes also have…
Two new relaxation schemes are proposed for the smoothing step in the geometric multigrid solution of PDEs on 2D and 3D stretched structured grids. The new schemes are characterized by efficient line relaxation on branched sets of lines of…