3 results
Search Results
Now showing 1 - 3 of 3
Item Young Researcher Award 2007(The Eurographics Association and Blackwell Publishing Ltd, 2007) Botsch, MarioItem Adaptive Space Deformations Based on Rigid Cells(The Eurographics Association and Blackwell Publishing Ltd, 2007) Botsch, Mario; Pauly, Mark; Wicke, Martin; Gross, MarkusWe propose a new adaptive space deformation method for interactive shape modeling. A novel energy formulation based on elastically coupled volumetric cells yields intuitive detail preservation even under large deformations. By enforcing rigidity of the cells, we obtain an extremely robust numerical solver for the resulting nonlinear optimization problem. Scalability is achieved using an adaptive spatial discretization that is decoupled from the resolution of the embedded object. Our approach is versatile and easy to implement, supports thin-shell and solid deformations of 2D and 3D objects, and is applicable to arbitrary sample-based representations, such as meshes, triangle soups, or point clouds.Item A Finite Element Method on Convex Polyhedra(The Eurographics Association and Blackwell Publishing Ltd, 2007) Wicke, Martin; Botsch, Mario; Gross, MarkusWe present a method for animating deformable objects using a novel finite element discretization on convex polyhedra. Our finite element approach draws upon recently introduced 3D mean value coordinates to define smooth interpolants within the elements. The mathematical properties of our basis functions guarantee convergence. Our method is a natural extension to linear interpolants on tetrahedra: for tetrahedral elements, the methods are identical. For fast and robust computations, we use an elasticity model based on Cauchy strain and stiffness warping.This more flexible discretization is particularly useful for simulations that involve topological changes, such as cutting or fracture. Since splitting convex elements along a plane produces convex elements, remeshing or subdivision schemes used in simulations based on tetrahedra are not necessary, leading to less elements after such operations. We propose various operators for cutting the polyhedral discretization. Our method can handle arbitrary cut trajectories, and there is no limit on how often elements can be split.