Sciweavers

42 search results - page 5 / 9
» Fast evaluation of polynomials and inverses of polynomials
Sort
View
CAGD
2008
98views more  CAGD 2008»
13 years 7 months ago
Exact evaluation of limits and tangents for non-polynomial subdivision schemes
In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision and its associated tangent vectors on a uniform grid of any size. Other exact eval...
S. Schaefer, J. Warren
SIAMNUM
2010
134views more  SIAMNUM 2010»
13 years 2 months ago
Nonequispaced Hyperbolic Cross Fast Fourier Transform
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
Michael Döhler, Stefan Kunis, Daniel Potts
SAC
2006
ACM
14 years 1 months ago
Improving the compensated Horner scheme with a fused multiply and add
Several different techniques and softwares intend to improve the accuracy of results computed in a fixed finite precision. Here we focus on a method to improve the accuracy of ...
Stef Graillat, Philippe Langlois, Nicolas Louvet
MOC
2002
135views more  MOC 2002»
13 years 7 months ago
A fast spherical harmonics transform algorithm
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a dr...
Reiji Suda, Masayasu Takami
PG
2007
IEEE
14 years 1 months ago
Fast and Faithful Geometric Algorithm for Detecting Crest Lines on Meshes
A new geometry-based finite difference method for a fast and reliable detection of perceptually salient curvature extrema on surfaces approximated by dense triangle meshes is pro...
Shin Yoshizawa, Alexander G. Belyaev, Hideo Yokota...