Quasi-Affine Transformation in Higher Dimension
Résumé
In many applications and in many fields, algorithms can con-siderably be speed up if the underlying arithmetical computations are considered carefully. In this article, we present a theoretical analysis of discrete affine transformations in higher dimension. More precisely, we investigate the arithmetical paving structure induced by the transforma-tion to design fast algorithms.
Domaines
Traitement des images [eess.IV]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...