Asymptotically fast computation of Hermite normal forms of integer matrices
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Applications quasi-affines et pavages du plan discret
Theoretical Computer Science
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Quasi-linear transformations and discrete tilings
Theoretical Computer Science
Reversible, Fast, and High-Quality Grid Conversions
IEEE Transactions on Image Processing
Quasi-Affine Transformation in 3-D: Theory and Algorithms
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Exact, scaled image rotations in finite Radon transform space
Pattern Recognition Letters
Quasi-linear transformations, numeration systems and fractals
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
| Hi-index | 0.00 |
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 discrete affine transformations in higher dimension. More precisely, we investigate the arithmetical paving structure induced by the transformation to design fast algorithms.