Results 81 to 90 of about 5,678 (257)
Computing Skinning Weights via Convex Duality
Computer Graphics Forum, EarlyView.We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley +1 more source
Interpolation remainder theory from taylor expansions with non-rectangular domains of influence
, 1972 Sobolev norm error bounds are derived for interpolation remainders on triangles using two types of Taylor expansion. These bounds are applied to the finite element analysis of Poisson's equation on a triangulation of a polygonal ...
Gregory, JA, Barnhill, RE
core
Register‐Efficient Linear‐Time Evaluation in the Bernstein Basis
Computer Graphics Forum, EarlyView.Abstract We investigate the evaluation of points and derivatives of Bézier curves and surfaces on modern architectures, focusing on performance and guided by numerical error bounds. While the de Casteljau algorithm remains the reference for numerical robustness, its linear working‐set size imposes substantial register pressure on GPUs.
Gábor Valasek, Anna Lili Horváth
wiley +1 more source
Contributions to polynomial interpolation in one and several variables
, 2011 Cette thèse traite de l'interpolation polynomiale des fonctions d'une ou plusieurs variables. Nous nous intéresserons principalement à l'interpolation de Lagrange mais un de nos travaux concerne les interpolations de Kergin et d'Hakopian.
Phung, Van Manh
core
The numerical stability of barycentric Lagrange interpolation
, 2004 The Lagrange representation of the interpolating polynomial can be rewritten in two more computationally attractive forms: a modified Lagrange form and a barycentric form.
Higham, Nicholas J. +2 more
core +1 more source
Establishing Shape Correspondences: A Survey
Computer Graphics Forum, EarlyView.Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley +1 more source
Computer Graphics Forum, EarlyView.Abstract We introduce mixed super‐circles, a position‐curvature formulation of the original dynamic 2D super‐helix model. Compared to the latter, purely curvature‐based model – the so‐called chained formulation –, the mixed formulation that we propose here drastically reduces the algorithmic complexity of the solving scheme – from quadratic to quasi ...
Emile Hohnadel +2 more
wiley +1 more source
On the Lagrange interpolation polynomials of entire functions
, 1984 This paper investigates the growth of an entire function ƒ and estimates the error term when approximating ƒ in the complex plane by Lagrange interpolation polynomials.
Al-Jarrah, Radwan
core +1 more source
Dynamic capital allocation in general insurance
Journal of Risk and Insurance, EarlyView.Abstract This paper provides a model for allocating capital to different insurance lines with varying development periods for a value‐maximizing insurance company. In our model, the company makes capitalization and exposure decisions considering its capital level and its relevant loss history.
Qiheng Guo +2 more
wiley +1 more source
Combined Shepard operators with Chebyshev nodes
Journal of Numerical Analysis and Approximation Theory, 2004 In this paper we study combined Shepard-Lagrange univariate interpolation operator\[S_{n,\mu}^{L,m}(Y;f,x):=S_{n,\mu}^{L,m}(f,x)=\frac{\sum\limits_{k=0}^{n+1}\left\vert x-y_{n,k}\right\vert ^{-\mu}(L_{m}f)(x,y_{n,k})}{\sum\limits_{k=0}^{n+1}\left\vert x ...
Cristina O. Oşan, Radu T. Trîmbitaş
doaj +2 more sources