Sciweavers

2570 search results - page 148 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
120
Voted
ISVC
2009
Springer
15 years 10 months ago
Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
Given a Cylindrical Algebraic Decomposition of an implicit algebraic curve, visualizing distinct curve arcs is not as easy as it stands because, despite the absence of singularitie...
Pavel Emeliyanenko, Eric Berberich, Michael Sagral...
131
Voted
EUROGRAPHICS
2010
Eurographics
15 years 4 months ago
Fast and Efficient Skinning of Animated Meshes
Skinning is a simple yet popular deformation technique combining compact storage with efficient hardware accelerated rendering. While skinned meshes (such as virtual characters) a...
Ladislav Kavan, Peter-Pike Sloan, Carol O'Sullivan
LATIN
1998
Springer
15 years 7 months ago
Fast Two-Dimensional Approximate Pattern Matching
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
Ricardo A. Baeza-Yates, Gonzalo Navarro
115
Voted
COMGEO
1999
ACM
15 years 3 months ago
Optimal triangulation and quadric-based surface simplification
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
Paul S. Heckbert, Michael Garland
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
15 years 8 months ago
The truncated fourier transform and applications
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
Joris van der Hoeven