6 research outputs found

    Adaptive Physically Based Models in Computer Graphics

    Get PDF
    International audienceOne of the major challenges in physically-based modeling is making simulations efficient. Adaptive models provide an essential solution to these efficiency goals. These models are able to self-adapt in space and time, attempting to provide the best possible compromise between accuracy and speed. This survey reviews the adaptive solutions proposed so far in computer graphics. Models are classified according to the strategy they use for adaptation, from time-stepping and freezing techniques to geometric adaptivity in the form of structured grids, meshes, and particles. Applications range from fluids, through deformable bodies, to articulated solids

    Locking-Proof Tetrahedra

    Get PDF
    The simulation of incompressible materials suffers from locking when using the standard finite element method (FEM) and coarse linear tetrahedral meshes. Locking increases as the Poisson ratio gets close to 0.5 and often lower Poisson ratio values are used to reduce locking, affecting volume preservation. We propose a novel mixed FEM approach to simulating incompressible solids that alleviates the locking problem for tetrahedra. Our method uses linear shape functions for both displacements and pressure, and adds one scalar per node. It can accommodate nonlinear isotropic materials described by a Young\u27s modulus and any Poisson ratio value by enforcing a volumetric constitutive law. The most realistic such material is Neo-Hookean, and we focus on adapting it to our method. For , we can obtain full volume preservation up to any desired numerical accuracy. We show that standard Neo-Hookean simulations using tetrahedra are often locking, which, in turn, affects accuracy. We show that our method gives better results and that our Newton solver is more robust. As an alternative, we propose a dual ascent solver that is simple and has a good convergence rate. We validate these results using numerical experiments and quantitative analysis

    A Smoothed Finite Element-Based Elasticity Model for Soft Bodies

    Get PDF
    One of the major challenges in mesh-based deformation simulation in computer graphics is to deal with mesh distortion. In this paper, we present a novel mesh-insensitive and softer method for simulating deformable solid bodies under the assumptions of linear elastic mechanics. A face-based strain smoothing method is adopted to alleviate mesh distortion instead of the traditional spatial adaptive smoothing method. Then, we propose a way to combine the strain smoothing method and the corotational method. With this approach, the amplitude and frequency of transient displacements are slightly affected by the distorted mesh. Realistic simulation results are generated under large rotation using a linear elasticity model without adding significant complexity or computational cost to the standard corotational FEM. Meanwhile, softening effect is a by-product of our method

    Model Simplification for Efficient Collision Detection in Robotics

    Get PDF
    Motion planning for industrial robots is a computationally intensive task due to the massive number of potential motions between any two configurations. Calculating all possibilities is generally not feasible. Instead, many motion planners sample a sub-set of the available space until a viable solution is found. Simplifying models to improve collision detection performance, a significant component of motion planning, results in faster and more capable motion planners. Several approaches for simplifying models to improve collision detection performance have been presented in the literature. However, many of them are sub-optimal for an industrial robotics application due to input model limitations, accuracy sacrifices, or the probability of increasing false negatives during collision queries. This thesis focuses on the development of model simplification approaches optimised for industrial robotics applications. Firstly, a new simplification approach, the Bounding Sphere Simplification (BSS), is presented that converts triangle-mesh inputs to a collection of spheres for efficient collision and distance queries. Additionally, BSS removes small features and generates an output model less prone to false negatives
    corecore