Quasi-Affine Transformation in 3-D: Theory and Algorithms
Résumé
In many applications and in many fields, algorithms can considerably be speed up if the underlying arithmetical computations are considered carefully. In this article, we present a theoretical analysis of affine transformations in dimension 3. More precisely, we investigate the arithmetical paving induced by the transformation to design fast algorithms.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...