Results 211 to 220 of about 72,363 (244)
Fast direct interpolation for computer graphics applications
AbstractInterpolation by the widely used spline function method requires excessive computation time because floating point arithmetic is used whenever a polynomial coefficient is determined. This paper presents a direct interpolation method (Fast Direct Interpolation) which attains sufficient precision with fixed point arithmetic.
Norio Akamatsu +2 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
CORDIC vector interpolator for power-aware 3D computer graphics
IEEE Workshop on Signal Processing Systems, 2003Real-time 3D graphics will be a major power consumer in future portable embedded systems. In this paper we present a 3D CORDIC vector interpolator for a power-aware graphics system. This new interpolator supports dynamic control of computing precision with an output accuracy range of 6 to 10 bits.
Euh, J, Chittamuru, J, Burleson, W
openaire +2 more sources
Parallel Computation of Trajectories Using Graphics Processing Units and Interpolated Gravity Models
Journal of Guidance, Control, and Dynamics, 2015Seeking improvements in speed and accuracy in multiobject trajectory simulations, a solution methodology is presented that takes advantage of 1) new high-fidelity geopotential and third-body perturbation models that efficiently trade memory for speed, and 2) a graphics processing unit based integrator to achieve parallelism across multiple objects. The
Nitin Arora +2 more
openaire +1 more source
Optical Engineering, 2013
An algorithm for interpolation of central fringe position in low-coherence interferometry measurements is presented. The algorithm is based on a polynomial curve fitting. Fast calculation of interpolation is possible due to the use of an NVIDIA Compute Unified Device Architecture (CUDA) technology, which allows independent analysis of different points ...
Tomczewski, S. +4 more
openaire +2 more sources
An algorithm for interpolation of central fringe position in low-coherence interferometry measurements is presented. The algorithm is based on a polynomial curve fitting. Fast calculation of interpolation is possible due to the use of an NVIDIA Compute Unified Device Architecture (CUDA) technology, which allows independent analysis of different points ...
Tomczewski, S. +4 more
openaire +2 more sources
Journal of Applied Remote Sensing, 2016
Kriging interpolation provides the best linear unbiased estimation for unobserved locations, but its heavy computation limits the manageable problem size in practice. To address this issue, an efficient interpolation procedure incorporating the fast Fourier transform (FFT) was developed.
Hongda Hu +3 more
openaire +1 more source
Kriging interpolation provides the best linear unbiased estimation for unobserved locations, but its heavy computation limits the manageable problem size in practice. To address this issue, an efficient interpolation procedure incorporating the fast Fourier transform (FFT) was developed.
Hongda Hu +3 more
openaire +1 more source
A lattice of interpolants with applications to computer graphics
Algebra Universalis, 1996The author considers interpolation formulas (in the sense of \textit{W. Gordon,} 1969) from a lattice theoretical point of view. It is shown that this viewpoint leads to a more structural outlook on how these maps are related to each other. Moreover, using the lattice theoretical relationships of the given boundary conditions, simple algorithms that ...
openaire +2 more sources
Hardware Adaptive High‐Order Interpolation for Real‐Time Graphics
Computer Graphics Forum, 2021Daqi Lin, L Seiler, Cem Yuksel
exaly

