3 research outputs found

    Animation of deformable bodies with quadratic bézier finite elements

    Get PDF
    pre-printIn this article, we investigate the use of quadratic finite elements for graphical animation of deformable bodies.We consider both integrating quadratic elements with conventional linear elements to achieve a computationally efficient adaptive-degree simulation framework as well as wholly quadratic elements for the simulation of nonlinear rest shapes. In both cases, we adopt the B´ezier basis functions and employ a co-rotational linear strain formulation. As with linear elements, the co-rotational formulation allows us to precompute per-element stiffness matrices, resulting in substantial computational savings. We present several examples that demonstrate the advantages of quadratic elements in general and our adaptive-degree system in particular. Furthermore, we demonstrate, for the first time in computer graphics, animations of volumetric deformable bodies with nonlinear rest shapes

    MINVO Basis: Finding Simplexes with Minimum Volume Enclosing Polynomial Curves

    Full text link
    This paper studies the problem of finding the smallest nn-simplex enclosing a given nthn^{\text{th}}-degree polynomial curve. Although the Bernstein and B-Spline polynomial bases provide feasible solutions to this problem, the simplexes obtained by these bases are not the smallest possible, which leads to undesirably conservative results in many applications. We first prove that the polynomial basis that solves this problem (MINVO basis) also solves for the nthn^\text{th}-degree polynomial curve with largest convex hull enclosed in a given nn-simplex. Then, we present a formulation that is \emph{independent} of the nn-simplex or nthn^{\text{th}}-degree polynomial curve given. By using Sum-Of-Squares (SOS) programming, branch and bound, and moment relaxations, we obtain high-quality feasible solutions for any n∈Nn\in\mathbb{N} and prove numerical global optimality for n=1,2,3n=1,2,3. The results obtained for n=3n=3 show that, for any given 3rd3^{\text{rd}}-degree polynomial curve, the MINVO basis is able to obtain an enclosing simplex whose volume is 2.362.36 and 254.9254.9 times smaller than the ones obtained by the Bernstein and B-Spline bases, respectively. When n=7n=7, these ratios increase to 902.7902.7 and 2.997⋅10212.997\cdot10^{21}, respectively.Comment: 25 pages, 16 figure
    corecore