Results 101 to 110 of about 501,741 (285)
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
Bivariate Lagrange interpolation at the Chebyshev nodes
, 2010 We discuss Lagrange interpolation on two sets of nodes in two dimensions where the coordinates of the nodes are Chebyshev points having either the same or opposite parity.
Lawrence Harris
core +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
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
A hierarchical access control scheme based on Lagrange interpolation for mobile agents
International Journal of Distributed Sensor Networks, 2018 The mobile agent is functioning as an information exchanger with hosts. In order to reduce the communication time that the host sent to the members of a large system.
Tsung-Chih Hsiao +4 more
doaj +1 more source
Lagrange interpolation and entire functions [PDF]
, 1990 For a function f defined almost everywhere on R. Let {Ln (f)} be the sequence of Lagrange interpolation polynomials that approximates f, where the nodes are taken to be the zeros of a certain sequence of orthogonal polynomials.
Al-Jarrah, Radwan, Al-Khaled, Kamel
core
Phong‐Rodrigues Extrinsic Vector‐Field Processing
Computer Graphics Forum, EarlyView.Abstract We introduce a new extrinsic discretization of tangent vector fields on triangle meshes that is continuous, with bounded derivatives that are continuous almost everywhere, supporting pointwise evaluation and integration of differential operators.
Hongyi Liu +4 more
wiley +1 more source
Transfinite Elements Using Bernstein Polynomials
AxiomsTransfinite interpolation, originally proposed in the early 1970s as a global interpolation method, was first implemented using Lagrange polynomials and cubic Hermite splines.
Christopher Provatidis
doaj +1 more source
On the Lagrange interpolation polynomials of entire functions [PDF]
, 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
On Bending in the As‐Rigid‐As‐Possible Deformation Energy
Computer Graphics Forum, EarlyView.Abstract The well‐established As‐Rigid‐As‐Possible (ARAP) energy has various forms. For surface deformation, commonly used energies contain an implicit bending penalty. We present a natural, continuous generalization that incorporates multiple ARAP versions with an implicit, user‐controllable bending penalty.
Ugo Finnendahl, Marc Alexa
wiley +1 more source